id:A023441 - OEIS Search Results

Search: id:A023441

Displaying 1-1 of 1 results found.

page 1

Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-11).

+0
1

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 143, 231, 372, 600, 967, 1559, 2513, 4051, 6530, 10526, 16967, 27350, 44086, 71064, 114550, 184647, 297638, 479772, 773359, 1246601, 2009434, 3239068, 5221152, 8416134 (list; graph; listen)

	OFFSET	`0,4`
	REFERENCES	`J. H. E. Cohn, Letter to the editor, Fib. Quart. 2 (1964), 108.` `V. E. Hoggatt, Jr., and D. A. Lind, The dying rabbit problem, Fib. Quart. 7 (1969), 482-487.`
	CROSSREFS	`See A000045 for the Fibonacci numbers.` `Sequence in context: A093089 A093091 A105471 this_sequence A023442 A000044 A107358` `Adjacent sequences: A023438 A023439 A023440 this_sequence A023442 A023443 A023444`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research