|
|
A205739
|
|
Number of 4X(n+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.
|
|
1
|
|
|
1683, 3318, 14715, 80088, 450339, 2565900, 14781282, 85852548, 502097979, 2953275825, 17454550770, 103577971653, 616733949822, 3682641041940, 22041854965854, 132187997823285, 794047508972499, 4776288839441496
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 23*a(n-1) -207*a(n-2) +867*a(n-3) -1178*a(n-4) -3567*a(n-5) +15272*a(n-6) -12652*a(n-7) -30210*a(n-8) +69591*a(n-9) -24010*a(n-10) -68468*a(n-11) +85661*a(n-12) -25742*a(n-13) -16279*a(n-14) +13561*a(n-15) -2008*a(n-16) -1025*a(n-17) +416*a(n-18) -44*a(n-19) for n>23.
|
|
EXAMPLE
|
Some solutions for n=4:
..1..2..2..2..2....0..0..0..1..2....1..0..1..2..0....1..1..2..2..1
..1..2..0..1..2....1..1..1..1..1....1..0..1..2..0....0..1..2..0..0
..2..0..2..2..1....1..1..1..1..1....2..1..2..0..1....1..2..1..2..1
..2..0..0..1..1....1..2..0..0..0....1..1..2..0..1....1..2..1..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|