|
| |
|
|
A163715
|
|
Number of nX3 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent
|
|
3
| |
|
|
6, 21, 48, 108, 236, 506, 1080, 2294, 4854, 10248, 21614, 45564, 96028, 202354, 426376, 898374, 1892838, 3988096, 8402638, 17703724, 37300364, 78588906, 165580536, 348864886, 735030230, 1548649464, 3262879566, 6874624124
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Same recurrence for A163696
Same recurrence for A163734
|
|
|
LINKS
| R. H. Hardin, Table of n, a(n) for n=1..41
|
|
|
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
...1.0.0...1.0.0...1.1.0...1.1.0...1.1.1...0.0.1...0.0.1...0.1.1...0.1.1
...1.0.0...1.1.0...1.0.0...1.1.0...1.0.0...0.0.1...0.1.1...0.0.1...0.1.1
------
...1.1.1...0.1.0...0.1.0...0.1.0...0.1.1...0.1.1...1.1.0...1.1.0...1.0.0
...0.0.1...0.1.0...0.1.1...1.1.0...0.1.0...1.1.0...0.1.0...0.1.1...1.1.1
------
...1.1.1...0.0.1...1.0.1
...1.0.1...1.1.1...1.1.1
|
|
|
CROSSREFS
| Sequence in context: A081266 A087863 A051941 * A028345 A097124 A135454
Adjacent sequences: A163712 A163713 A163714 * A163716 A163717 A163718
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| R. H. Hardin (rhhardin(AT)att.net) Aug 03 2009
|
| |
|
|
