[seqfan] Re: wanted: solution to a recurrence
Alexander P-sky
apovolot at gmail.com
Thu Oct 21 19:26:25 CEST 2010
Plugging the solution into WolframAlpha gives
Repeating block:
1, 3, 3 (3 elements; 3 repetitions)
Possible closed form:
a_n = Mod[2 n^2+2 n, 3, 1] (for all terms given)
Possible continuation:
1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,1,3,3,...
Possible recurrence relation:
a_(n+3) = a_n
Possible generating function:
(script capital g)_n(a_n)(z) = (-3 z^2-3 z-1)/(z^3-1)
AP
On 10/21/10, N. J. A. Sloane <njas at research.att.com> wrote:
> PS As sson as I posted that message, I found a solution:
> 1 3 3 1 3 3 1 3 3 ...
> Neil
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
More information about the SeqFan
mailing list