|
| |
|
|
A205819
|
|
Number of (n+1)X5 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock unequal to the number of anticlockwise edge increases
|
|
1
|
|
|
|
492, 2430, 12318, 67944, 380568, 2158482, 12281976, 70022628, 399463842, 2279603796, 13010464716, 74259457206, 423858388308, 2419327070832, 13809259294038, 78821939400948, 449908555238976, 2568038752491042
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Column 4 of A205823
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
|
FORMULA
|
Empirical: a(n) = 10*a(n-1) -18*a(n-2) -83*a(n-3) +264*a(n-4) +171*a(n-5) -1140*a(n-6) +234*a(n-7) +2180*a(n-8) -1280*a(n-9) -1912*a(n-10) +1667*a(n-11) +624*a(n-12) -873*a(n-13) +32*a(n-14) +162*a(n-15) -31*a(n-16) -8*a(n-17) +2*a(n-18)
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..2..1..2....2..2..0..1..0....1..2..0..2..0....2..1..0..0..2
..2..1..0..1..0....0..1..0..2..0....0..2..1..1..0....0..1..2..1..1
..0..1..2..1..2....0..2..0..1..0....1..2..0..2..2....2..1..0..0..2
..2..1..0..0..0....1..1..0..2..0....0..2..1..1..0....0..1..2..1..1
..0..1..2..1..2....0..2..0..1..0....1..2..0..2..2....2..1..0..0..2
|
|
|
CROSSREFS
|
Sequence in context: A217118 A205200 A205058 * A007242 A198531 A116207
Adjacent sequences: A205816 A205817 A205818 * A205820 A205821 A205822
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin Feb 01 2012
|
|
|
STATUS
|
approved
|
| |
|
|
