|
| |
|
|
A183853
|
|
Number of (n+1)X9 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others
|
|
1
|
|
|
|
92771, 2568541, 65461226, 2373353909, 84948077733, 3637653147102, 154188934678551, 6963325147796767, 312016957670582226, 14275770710942816651, 650555611278894371929, 29856567303793299342810
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for 3X9
..0..0..2..0..2..0..2..2..0....0..0..0..0..0..2..0..2..0
..2..2..0..2..0..2..0..2..0....2..2..2..2..2..2..2..2..0
..2..0..2..2..2..2..2..2..0....0..2..0..0..0..2..0..0..2
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
