|
| |
|
|
A183832
|
|
Number of (n+1)X6 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others
|
|
1
|
|
|
|
9307, 237671, 5935955, 159806751, 4200572147, 113949885751, 3044918926037, 82530377465595, 2218534760391843, 60039731283580691, 1617868356124866857, 43738671870005967743, 1179873005951018387761, 31878907168394280066213
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for 3X6
..1..1..1..1..1..2....0..1..1..0..1..2....1..1..1..1..2..1....0..2..1..2..1..0
..2..2..0..2..0..2....2..2..2..1..2..0....0..2..0..2..0..2....2..1..2..0..1..2
..1..1..1..2..1..2....1..0..1..2..1..2....1..2..1..1..1..2....1..2..1..1..2..1
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
