login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109539 a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+a(n-7)+a(n-8). 0

%I #2 Mar 30 2012 17:34:19

%S 1,1,1,1,1,1,1,1,7,7,13,19,31,49,79,127,205,325,523,835,1339,2143,

%T 3433,5497,8803,14095,22573,36145,57883,92689,148429,237685,380617,

%U 609499,976021,1562947,2502823,4007887,6418021,10277479,16457815,26354677

%N a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+a(n-7)+a(n-8).

%t F[1] = 1; F[2] = 1; F[3] = 1; F[4] = 1; F[5] = 1; F[6] = 1; F[7] = 1; F[8] = 1; F[n__] := F[n] = F[n - 2] + F[n - 3] + F[n - 4] + F[n - 5] + F[n - 6] + F[n - 7] + F[n - 8] aa = Table[F[n], {n, 1, 50}]

%K nonn

%O 0,9

%A _Roger L. Bagula_, Jun 20 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 17:20 EDT 2024. Contains 371962 sequences. (Running on oeis4.)