|
|
A205991
|
|
Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to two, and every 2 X 2 determinant nonzero.
|
|
1
|
|
|
26, 92, 330, 1184, 4250, 15252, 54738, 196448, 705026, 2530252, 9080754, 32589688, 116960298, 419755820, 1506450938, 5406463248, 19403117738, 69635353188, 249912538754, 896904721104, 3218878423314, 11552150479772, 41459217515106
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 2*a(n-1) + 5*a(n-2) + 3*a(n-3) - 2*a(n-4) + a(n-5).
Empirical g.f.: 2*x*(13 + 20*x + 8*x^2 - 7*x^3 + 4*x^4) / (1 - 2*x - 5*x^2 - 3*x^3 + 2*x^4 - x^5). - Colin Barker, Jun 13 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..1..0....1..2....2..2....1..1....2..0....2..0....2..1....1..2....2..0....0..1
..2..1....1..0....1..0....0..2....1..2....1..2....0..2....0..1....0..1....2..2
..1..2....2..1....2..1....1..0....0..1....1..0....1..0....2..2....2..2....1..0
..2..1....0..2....1..2....2..1....1..2....0..1....2..1....1..0....1..0....2..1
..1..2....2..1....0..2....0..2....1..0....1..0....1..0....2..1....0..2....0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|