|
|
A163882
|
|
Number of nXnXn triangular binary arrays with all 1s connected, no 1 having more than 3 1s adjacent, and a path of 1s from peak vertex to anywhere on the bottom side
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
All solutions for n=3
....1......1......1......1......1......1......1......1......1......1......1..
...1.0....1.1....1.0....1.0....1.0....1.0....1.1....1.1....0.1....0.1....0.1.
..0.1.0..0.1.0..1.1.0..0.1.1..1.1.1..1.0.0..1.0.0..1.0.1..0.1.0..1.1.0..0.1.1
------
....1......1......1..
...0.1....0.1....1.1.
..1.1.1..0.0.1..0.0.1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|