|
| |
|
|
A163696
|
|
Number of nX3 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent
|
|
3
| |
|
|
3, 11, 28, 63, 138, 298, 642, 1371, 2908, 6146, 12970, 27351, 57654, 121502, 256026, 539459, 1136632, 2394830, 5045754, 10631039, 22398786, 47192482, 99430802, 209492731, 441384340, 929961258, 1959353418, 4128199671, 8697783790
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Same recurrence for A163715
Same recurrence for A163734
|
|
|
LINKS
| R. H. Hardin, Table of n, a(n) for n=1..57
|
|
|
FORMULA
| Empirical: a(n)=4*a(n-1)-5*a(n-2)+2*a(n-3)+a(n-4)-2*a(n-5)+a(n-6) for n>=10
|
|
|
EXAMPLE
| All solutions for n=2
...0.0.1...0.1.1...0.0.1...0.1.1...1.1.1...0.0.1...1.1.1...0.1.0...1.1.0
...0.0.1...0.0.1...0.1.1...0.1.1...0.0.1...1.1.1...1.0.1...0.1.1...0.1.1
------
...1.0.0...1.0.1
...1.1.1...1.1.1
|
|
|
CROSSREFS
| Sequence in context: A003060 A136983 A119074 * A092781 A018743 A077279
Adjacent sequences: A163693 A163694 A163695 * A163697 A163698 A163699
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| R. H. Hardin (rhhardin(AT)att.net) Aug 03 2009
|
| |
|
|
