Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109540
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 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; listen)
OFFSET

0,9

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: A020785 A090654 A001732 this_sequence A040057 A028997 A112439

Adjacent sequences: A109537 A109538 A109539 this_sequence A109541 A109542 A109543

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 20 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research