proposed

approved

editing

proposed

a(n)=(1/33)*{18*(n mod 12)+40*[(n+1) mod 12]+84*[(n+2) mod 12]-4*[(n+3) mod 12]+84*[(n+4) mod 12]+40*[(n+5) mod 12]+18*[(n+6) mod 12]-4*[(n+7) mod 12]-48*[(n+8) mod 12]+40*[(n+9) mod 12]-48*[(n+10) mod 12]-4*[(n+11) mod 12]}, with n>=0 [From Paolo P. Lava, Feb 13 2009]

approved

editing

editing

approved

<a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, -1, 1).

8*Mod[Fibonacci[Range[1, 151, 2]], 9] (* or *) PadRight[{}, 80, {8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8}] (* Harvey P. Dale, Jul 10 2018 *)

approved

editing

a(n)=(1/33)*{18*(n mod 12)+40*[(n+1) mod 12]+84*[(n+2) mod 12]-4*[(n+3) mod 12]+84*[(n+4) mod 12]+40*[(n+5) mod 12]+18*[(n+6) mod 12]-4*[(n+7) mod 12]-48*[(n+8) mod 12]+40*[(n+9) mod 12]-48*[(n+10) mod 12]-4*[(n+11) mod 12]}, with n>=0 [From _Paolo P. Lava (paoloplava(AT)gmail.com), _, Feb 13 2009]

_Paul Curtz (bpcrtz(AT)free.fr), _, Feb 08 2009

Edited and extended by _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Apr 10 2009

a(n)=(1/33)*{18*(n mod 12)+40*[(n+1) mod 12]+84*[(n+2) mod 12]-4*[(n+3) mod 12]+84*[(n+4) mod 12]+40*[(n+5) mod 12]+18*[(n+6) mod 12]-4*[(n+7) mod 12]-48*[(n+8) mod 12]+40*[(n+9) mod 12]-48*[(n+10) mod 12]-4*[(n+11) mod 12]}, with n>=0 [From Paolo P. Lava (pplpaoloplava(AT)splgmail.atcom), Feb 13 2009]

a(n)=8*A154811. Even palindrom of period 12:repeat 8,16,40,32,56,64,64,56,32,40,16,8.

a(n)=8*A154811(n).

8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40

a(n) mod 9=8,7,4,5,2,1,1,2,5,4,7,8,=A154811(n+6)=A155110 mod 9;then linked to A014217=1,1,2,4,6,11,17,29, and Fibonacci A000045(2n+1).

Period length 12: a(n)=a(n-12).

a(n) = A154811(n+6) = A155110(n) (mod 9).

nonn,uned,neweasy

Edited and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 10 2009