|
| |
|
|
A203637
|
|
Number of n X 7 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.
|
|
1
|
|
|
|
6, 222, 7636, 103690, 16080792, 835055180, 14513555724, 2569455032894, 146312253947688, 2722270161317096, 504142571118827960, 29822099016054530934, 572854110550094487544, 108558379526448971465452
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for n=3
..1..1..0..0..0..0..1....1..1..1..1..1..1..1....0..0..1..1..1..1..1
..1..1..0..0..1..1..0....1..0..0..0..0..0..1....0..0..1..1..0..1..1
..1..1..0..0..1..1..0....1..1..1..0..0..0..0....1..0..0..0..0..0..1
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
