id:A023440 - OEIS Search Results

Search: id:A023440

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 88, 142, 228, 367, 590, 949, 1526, 2454, 3946, 6345, 10203, 16406, 26381, 42420, 68211, 109682, 176367, 283595, 456016, 733266, 1179079, 1895939, 3048637, 4902156, 7882582 (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: A121343 A023439 A013987 this_sequence A077373 A132634 A096275` `Adjacent sequences: A023437 A023438 A023439 this_sequence A023441 A023442 A023443`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified August 29 14:50 EDT 2008. Contains 143238 sequences.

AT&T Labs Research