Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2).
0, 1, 2, 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860, 33461, 80782, 195025
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
15 seqfan posts
Fri Dec 23 03:45:04 CET 2011 [seqfan] Re: A140993
Fri Dec 23 02:43:37 CET 2011 [seqfan] Re: A140993
Sun Jul 24 21:44:00 CEST 2011 [seqfan] Some OEIS-related YouTube videos
Fri Mar 11 13:57:44 CET 2011 [seqfan] Re: Period lengths of k^2 mod n not in OEIS ?
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java
Wed May 19 10:02:52 CEST 2010 [seqfan] Re: A method to generate sequences
Tue May 18 16:52:55 CEST 2010 [seqfan] Re: A method to generate sequences
Tue May 18 11:55:47 CEST 2010 [seqfan] A method to generate sequences
Fri Dec 11 20:40:43 CET 2009 [seqfan] Divisibility sequences in OEIS.
Wed Dec 2 20:48:04 CET 2009 [seqfan] Re: Property of Fibonacci sequence modulo M
Wed Dec 2 20:15:32 CET 2009 [seqfan] Re: Property of Fibonacci sequence modulo M
Mon Oct 26 09:36:25 CET 2009 [seqfan] A metric and UI for Pandora-like OEIS exploration
Thu Feb 5 17:23:06 CET 2009 [seqfan] More conjectures on sequence products
Sun Jan 11 23:36:02 CET 2009 [seqfan] Index of linear recurrences
Tue Dec 30 19:25:53 CET 2008 [seqfan] Re: You wouldn't believe (fwd) A005178
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
.