Padovan sequence: a(n) = a(n-2) + a(n-3) with a(0)=1, a(1)=a(2)=0.
1, 0, 0, 1, 0, 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200
7 seqfan posts
Sun Jul 24 21:44:00 CEST 2011 [seqfan] Some OEIS-related YouTube videos
Sat Oct 16 16:03:42 CEST 2010 [seqfan] Re: Penney's game sequences
Fri Oct 15 22:21:32 CEST 2010 [seqfan] Penney's game sequences
Wed Mar 17 22:55:04 CET 2010 [seqfan] Re: Padovan sequence
Wed Mar 17 22:21:33 CET 2010 [seqfan] Padovan sequence
Tue Jan 12 02:44:51 CET 2010 [seqfan] Re: enumeration of siphons in chemical reaction networks
Fri Jan 8 04:08:13 CET 2010 [seqfan] Re: enumeration of siphons in chemical reaction networks
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
.