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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109540 a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+2*a(n-7)+a(n-8). 0
1, 1, 1, 1, 1, 1, 1, 1, 8, 8, 15, 22, 36, 57, 92, 155, 246, 400, 645, 1044, 1688, 2731, 4425, 7155, 11579, 18733, 30311, 49043, 79353, 128402, 207754, 336155, 543908, 880062, 1423969, 2304030, 3728005, 6032034, 9760038, 15792071, 25552108, 41344178 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

LINKS

Table of n, a(n) for n=0..41.

MATHEMATICA

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] + 2*F[n - 7] + F[n - 8] aa = Table[F[n], {n, 1, 50}]

CROSSREFS

Sequence in context: A343526 A335896 A168337 * A229554 A298182 A040057

Adjacent sequences: A109537 A109538 A109539 * A109541 A109542 A109543

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Jun 20 2005

STATUS

approved

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 December 9 19:36 EST 2022. Contains 358703 sequences. (Running on oeis4.)