|
| |
|
|
A210168
|
|
Number of (n+1)X3 0..3 arrays containing all values 0..3 with every 2X2 subblock having two or four distinct values, and new values 0..3 introduced in row major order
|
|
1
|
|
|
|
10, 201, 3283, 48577, 679253, 9173091, 121178151, 1578188865, 20364553277, 261193130859, 3336758862031, 42516443800121, 540813127075381, 6871496034443795, 87244283342152055, 1107170119794198769
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Column 2 of A210174
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
|
FORMULA
|
Empirical: a(n) = 32*a(n-1) -362*a(n-2) +1648*a(n-3) -1561*a(n-4) -7568*a(n-5) +11440*a(n-6) +11360*a(n-7) -14768*a(n-8) -6400*a(n-9) +3840*a(n-10)
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0....0..1..1....0..1..1....0..0..0....0..1..2....0..0..0....0..0..0
..1..0..1....0..0..0....0..0..0....0..1..0....2..3..0....0..1..0....0..1..0
..0..0..0....0..1..0....0..1..1....0..0..0....0..1..2....1..0..1....0..0..0
..1..0..1....0..0..0....1..1..2....1..1..1....0..1..1....2..3..2....0..1..0
..2..3..2....2..0..3....1..3..0....2..1..3....1..0..0....0..1..0....2..3..2
|
|
|
CROSSREFS
|
Sequence in context: A051262 A178020 A041183 * A041180 A027014 A088746
Adjacent sequences: A210165 A210166 A210167 * A210169 A210170 A210171
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin Mar 18 2012
|
|
|
STATUS
|
approved
|
| |
|
|
