|
|
A203635
|
|
Number of nX5 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other
|
|
1
|
|
|
8, 26, 236, 3824, 58816, 951900, 16080792, 278135578, 4911608328, 88014442794, 1595784960340, 29207585540256, 538759416109136, 10003103446747306, 186764193731244404, 3503820046529733422, 66010275892736979884
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=5
..0..0..0..1..0....0..0..0..0..1....1..0..1..1..1....1..1..1..0..0
..0..0..0..1..0....0..0..0..1..1....1..0..1..1..0....0..1..1..1..0
..0..0..1..1..0....0..0..1..0..1....0..0..1..1..1....0..1..0..1..0
..1..0..1..1..0....1..1..1..0..1....0..0..1..1..0....1..1..0..0..0
..1..1..1..1..1....1..1..1..0..1....0..0..0..0..0....1..1..0..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|