|
|
A183588
|
|
1/24 the number of (n+1)X4 0..3 arrays with every 2X2 subblock containing exactly three distinct values
|
|
1
|
|
|
520, 27380, 1427084, 74491726, 3887550226, 202888369698, 10588548225946, 552606468835138, 28840014212057954, 1505133360863436226, 78551501834521854626, 4099529385937940277538, 213950603015925389996738
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n)=51*a(n-1)+274*a(n-2)-10688*a(n-3)-31344*a(n-4)+590588*a(n-5)+1621408*a(n-6)-5825824*a(n-7)-7929216*a(n-8)+17443840*a(n-9)+6201344*a(n-10)-11993088*a(n-11)
|
|
EXAMPLE
|
Some solutions with a(1,1)=0 for 3X4
..0..2..0..3....0..1..0..0....0..2..0..0....0..1..2..0....0..2..0..2
..0..3..0..1....0..2..1..3....3..3..2..3....1..3..1..2....1..2..1..1
..3..1..1..3....0..1..0..1....1..0..2..1....0..1..0..1....0..0..2..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|