Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072465
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072465 A Fibonacci-like model in which each pair of rabbits dies after the birth of their 4-th litter: a(n) = a(n-2) + a(n-3) + a(n-4) + a(n-5). +0
1
1, 1, 1, 2, 3, 5, 7, 11, 17, 26, 40, 61, 94, 144, 221, 339, 520, 798, 1224, 1878, 2881, 4420, 6781, 10403, 15960, 24485, 37564, 57629, 88412, 135638, 208090, 319243, 489769, 751383, 1152740, 1768485, 2713135, 4162377, 6385743, 9796737 (list; graph; listen)
OFFSET

0,4

COMMENT

lim n ->infinity a(n+1)/a(n) = 1.534157744914.... is the root of x^5 = x^3+x^2+x+1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 2002

REFERENCES

Gridgeman, N. T.; Fibonacci Quart., vol. 11 (1973), no. 1, 40-55

FORMULA

a(n) = a(n-1) + a(n-2) - a(n-6); g.f.: = (1 + x)/(1 - x^2 - x^3 - x^4 - x^5).

MATHEMATICA

CoefficientList[ Series[(1 + x)/(1 - x^2 - x^3 - x^4 - x^5), {x, 0, 40}], x]

CROSSREFS

Sequence in context: A055500 A018058 A002379 this_sequence A052284 A133670 A127272

Adjacent sequences: A072462 A072463 A072464 this_sequence A072466 A072467 A072468

KEYWORD

easy,nonn

AUTHOR

Leonardo Fonseca (fonleo(AT)fisica.ufmg.br), Jun 19 2002

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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research