|
|
A206755
|
|
Number of (n+1)X3 0..2 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order
|
|
1
|
|
|
106, 2187, 46860, 1002015, 21403411, 457325164, 9771502433, 208781853511, 4460929715062, 95314283208603, 2036528732366433, 43513408950473466, 929727495885160693, 19864984988374035589, 424444399488287893292
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Column 2 of A206761
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
FORMULA
|
Empirical: a(n) = 16*a(n-1) +86*a(n-2) +577*a(n-3) +694*a(n-4) +1376*a(n-5) -823*a(n-6) +136*a(n-7) -2266*a(n-8) -461*a(n-9) -1230*a(n-10)
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0....0..1..2....0..1..0....0..0..0....0..0..0....0..1..1....0..1..0
..0..1..2....0..2..1....0..0..2....0..1..2....1..2..1....2..2..2....0..1..2
..0..2..1....0..2..1....1..0..0....2..0..1....2..1..2....1..2..0....2..0..0
..0..2..2....2..1..2....2..0..1....2..2..0....1..0..2....2..1..2....0..2..0
..2..0..1....2..1..2....0..2..0....0..1..1....1..1..1....1..1..1....2..2..1
|
|
CROSSREFS
|
Sequence in context: A184217 A184209 A233047 * A200969 A234413 A083963
Adjacent sequences: A206752 A206753 A206754 * A206756 A206757 A206758
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. H. Hardin Feb 12 2012
|
|
STATUS
|
approved
|
|
|
|