Hello Mariusz,
I greatly appreciate your continual help on my question!
I looked at your two attached files (in your previous post). It is making great progress and the solution is nearly there! But, there is a small problem with the Maple/Mathematica program (probably, unexpected variable values somewhere in memory). It does not yield the correct values for b[k].
With regards to the question:
For integers k greater than or equal to 3, b[k] = b[k-1] + b[k-3] + 2*[.0794367(.460811)^((k-1)/2) + .255972(-.675131)^((k-1)/2) + .664591(3.21432)^((k-1)/2)], if k is odd; b[k] = b[k-1] + b[k-2], if k is even; b[0] = 1, b[1] = 4, b[2] = 5.
This piecewise defined recurrence relation is correct. I verified (using this piecewise defined recurrence relation, by hand calculations) the correct values:
b[0]=1, b[1]=4, b[2]=5, b[3]=10, b[4]=15, b[5]=34, b[6]=49, b[7]=108, b[8]=157, b[9]=348, b[10]=505, etc.
If you have some time, can you look at your Maple/Mathematica program and see what is happening? We are so close to a "closed-form" solution to b[k] !!
I am greatly indebted to you for your valuable help.
Sincerely,
Richard M. Low