|
|
A210269
|
|
Half the number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having two or three distinct clockwise edge differences.
|
|
1
|
|
|
35, 273, 2130, 16620, 129684, 1011912, 7895856, 61610640, 480742176, 3751187136, 29270169408, 228392449152, 1782125347584, 13905760747776, 108505376592384, 846657508568064, 6606390939571200, 51549062997460992, 402232613876871168
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 8*a(n-1) - 12*a(n-3).
Empirical g.f.: x*(35 - 7*x - 54*x^2) / (1 - 8*x + 12*x^3). - Colin Barker, Jul 15 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..1..1....2..1....2..1....2..1....2..0....2..0....0..2....2..2....1..2....1..1
..0..0....0..0....1..1....2..2....2..2....1..0....2..0....1..2....1..1....2..0
..2..0....1..2....0..1....1..2....0..1....0..0....0..2....2..2....1..2....0..2
..0..2....2..1....2..2....0..2....2..1....1..0....0..1....1..2....1..0....2..2
..0..0....1..0....1..2....2..2....2..1....2..1....1..2....1..1....1..2....2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|