|
Search: id:A069306
|
|
|
| A069306 |
|
Number of 2 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column. |
|
+0
27
|
|
| 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860, 33461, 80782, 195025, 470832, 1136689, 2744210, 6625109, 15994428, 38613965
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
G.f. x^2(2x+5)/(1-2x-x^2). a(n) = Pell(n+1), as proved by Tomislav Doslic. - R. Stephan, Nov 16 2004
|
|
CROSSREFS
|
Cf. 3 X n A069307, 4 X n A069308, 5 X n A069309, 6 X n A069310, 7 X n A069311, 8 X n A069312, 9 X n A069313, 10 X n A069314, 11 X n A069315, 12 X n A069316, 13 X n A069317, 14 X n A069318, 15 X n A069319, 16 X n A069320, by columns A069294-A069305.
Cf. A000129, A048624, A077985.
Sequence in context: A002767 A055245 A000465 this_sequence A009412 A009428 A094125
Adjacent sequences: A069303 A069304 A069305 this_sequence A069307 A069308 A069309
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhh(AT)cadence.com), Mar 14 2002
|
|
|
Search completed in 0.002 seconds
|
