|
| |
|
|
A210090
|
|
Number of (n+1)X4 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order
|
|
1
|
|
|
|
90, 2370, 57232, 1318221, 29356228, 639141361, 13698519779, 290324839303, 6103041497311, 127519984428456, 2652384495217319, 54979384455905446, 1136640525774010786, 23451581988184791928, 483112213807378047958
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Column 3 of A210095
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
|
FORMULA
|
Empirical: a(n) = 40*a(n-1) -446*a(n-2) +766*a(n-3) +4061*a(n-4) -6645*a(n-5) -8411*a(n-6) +13005*a(n-7) -317*a(n-8) -2372*a(n-9) +320*a(n-10)
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..1..2....0..0..0..0....0..1..0..1....0..0..0..0....0..0..0..1
..0..0..1..2....0..0..0..0....1..0..0..0....1..0..1..1....2..2..0..0
..0..0..1..2....1..0..0..1....1..0..2..2....1..1..0..0....1..2..0..1
..0..0..1..1....0..0..0..0....1..0..2..1....1..0..1..1....2..2..0..0
..2..0..0..1....2..0..1..0....1..0..2..1....1..1..1..2....0..2..2..0
|
|
|
CROSSREFS
|
Sequence in context: A065951 A008393 A055603 * A109124 A013359 A013355
Adjacent sequences: A210087 A210088 A210089 * A210091 A210092 A210093
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin Mar 17 2012
|
|
|
STATUS
|
approved
|
| |
|
|
