|
|
A183834
|
|
Number of (n+1)X8 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others
|
|
1
|
|
|
165979, 10698847, 666851127, 45786104591, 3044918926037, 211222113324755, 14358430351511371, 995346656959800911, 68219544649374995309, 4720188015916778912773, 324617770000884333815623
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 3X8
..0..1..0..2..0..2..1..1....0..1..0..1..0..2..1..0....0..1..0..1..0..2..1..1
..2..1..2..1..1..2..0..2....2..1..2..2..1..1..2..2....1..2..1..2..1..2..0..2
..0..2..1..2..0..1..1..2....0..2..1..1..0..2..1..0....0..2..0..1..0..2..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|