|
| |
|
|
A183852
|
|
Number of (n+1)X8 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others
|
|
1
|
|
|
|
29863, 591211, 10793131, 265093125, 6355114021, 181527680767, 5102345174752, 154188934678551, 4604277587760239, 141296909019355751, 4307449067043766425, 132709859004874156095, 4075563520087286739862, 125698794388164258100562
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for 3X8
..0..2..0..2..2..2..2..0....2..0..2..0..2..0..2..0....0..2..0..2..2..0..2..2
..2..0..2..2..0..2..0..2....0..2..2..2..2..0..2..2....2..0..2..0..0..2..0..0
..0..2..0..0..2..0..2..0....0..2..0..2..0..2..0..0....2..2..2..0..0..2..2..2
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
