|
| |
|
|
A266130
|
|
Number of nX7 integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.
|
|
0
|
|
|
|
25, 2141, 11044, 347576, 16386099, 325554385, 10444421518, 364864463172, 9780785065374, 322718526988333, 10659390930051828, 315717305995251778
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for n=3
..1..1..1..2..1..2..0....1..2..3..2..1..1..0....1..1..1..2..0..2..1
..2..0..0..3..2..0..1....1..0..3..2..1..0..1....0..0..2..1..1..0..0
..1..1..2..1..2..1..0....0..1..2..1..0..2..0....1..2..1..2..2..1..1
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
