Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, a(n) = a(n-1)+a(n-2)-a(n-13).
1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 232, 375, 606, 979, 1582, 2556, 4130, 6673
3 seqfan posts
Sat Mar 24 22:18:44 CET 2012 [seqfan] Re: Sequences that need b-files
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java
Mon Jan 19 18:40:38 CET 2009 [seqfan] How to generate A000047?
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.