|
|
A251505
|
|
Number of (n+1)X(6+1) 0..3 arrays with every 2X2 subblock summing to 3 4 5 6 7 8 or 9
|
|
1
|
|
|
138426508, 1270162626436, 11635518782310748, 106642617845371027692, 977403456340809520106712, 8958155131152979319436818316, 82103804631580381524974704047000, 752502590962825725727396598604672812
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..0..0..1..1..0..1....0..0..2..2..3..0..2....0..0..0..2..2..0..3
..3..0..3..3..3..3..1....3..0..2..3..1..3..1....3..0..3..1..0..3..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|