|
| |
|
|
A163704
|
|
Number of nX2 binary arrays with all 1s connected, a path of 1s from left column to lower right corner, and no 1 having more than two 1s adjacent
|
|
1
| |
|
|
1, 5, 11, 21, 38, 66, 112, 187, 309, 507, 828, 1348, 2190, 3553, 5759, 9329, 15106, 24454, 39580, 64055, 103657, 167735, 271416, 439176, 710618, 1149821, 1860467, 3010317, 4870814, 7881162, 12752008, 20633203, 33385245, 54018483, 87403764
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| R. H. Hardin, Table of n, a(n) for n=1..100
|
|
|
FORMULA
| Empirical: a(n)=3*a(n-1)-2*a(n-2)-a(n-3)+a(n-4) for n>=6
|
|
|
EXAMPLE
| All solutions for n=3
...0.0...0.0...0.0...0.0...1.0...0.1...1.1...0.0...1.0...1.1...1.1
...0.0...0.1...1.0...1.1...1.0...0.1...1.0...1.1...1.1...0.1...0.1
...1.1...1.1...1.1...1.1...1.1...1.1...1.1...0.1...0.1...0.1...1.1
|
|
|
CROSSREFS
| Cf. A023548. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 06 2009]
Sequence in context: A164096 A163787 A166863 * A131898 A168642 A184552
Adjacent sequences: A163701 A163702 A163703 * A163705 A163706 A163707
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| R. H. Hardin (rhhardin(AT)att.net) Aug 03 2009
|
| |
|
|
