login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122522 a(n) = a(n - 2) + a(n - 8). 4

%I

%S 1,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,7,7,10,10,14,14,19,19,26,26,36,36,50,

%T 50,69,69,95,95,131,131,181,181,250,250,345,345,476,476,657,657,907,

%U 907,1252,1252,1728,1728,2385,2385,3292,3292,4544,4544,6272,6272,8657,8657

%N a(n) = a(n - 2) + a(n - 8).

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

%F G.f.: x*(1+x)/(1 - x^2 - x^8). - _G. C. Greubel_, May 01 2017

%t CoefficientList[Series[x*(1 + x)/(1 - x^2 - x^8), {x,0,50}], x] (* _G. C. Greubel_, May 01 2017 *)

%o (PARI) x='x+O('x^50); Vec(x*(1+x)/(1 - x^2 - x^8)) \\ _G. C. Greubel_, May 01 2017

%Y Cf. A003269.

%K nonn,easy,less

%O 1,9

%A _Roger L. Bagula_, Sep 16 2006

%E Edited by _N. J. A. Sloane_, Sep 17 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 13:53 EDT 2021. Contains 345165 sequences. (Running on oeis4.)