|
| |
|
|
A251387
|
|
Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock summing to 2 3 4 5 or 6.
|
|
1
|
|
|
|
295759, 128887759, 56040713651, 24381056748093, 10607219852841053, 4614802877342194801, 2007727783867224687619, 873487174422941192592727, 380021561340335015020932351, 165333151346118950517287569313
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..0..2..0..1..2....0..2..0..0..1..1....0..0..1..1..1..1....0..0..0..1..2..2
..2..1..1..0..1..2....0..0..1..2..2..2....1..1..0..1..0..1....0..2..2..1..1..1
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
