|
|
A183850
|
|
Number of (n+1)X6 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others
|
|
1
|
|
|
3117, 31767, 310856, 3608259, 40482339, 515409762, 6355114021, 84948077733, 1105084856456, 15097065676125, 202145260814529, 2788105721299106, 37932546061923769, 525522558282998873, 7216077958334209878
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 3X6
..2..1..3..1..3..3....3..1..2..3..3..1....2..3..3..1..3..1....0..0..2..0..2..2
..3..1..2..3..2..1....2..3..1..1..2..3....3..1..2..1..2..3....2..2..0..2..0..2
..2..3..1..3..1..3....3..1..2..3..3..1....2..1..3..1..3..1....0..2..2..2..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|