|
| |
|
|
A205249
|
|
Number of (n+1) X 3 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock the same.
|
|
1
|
|
|
|
40, 168, 752, 3416, 15568, 71000, 323856, 1477272, 6738640, 30738648, 140215952, 639602456, 2917580368, 13308696920, 60708323856, 276924225432, 1263204479440, 5762173946328, 26284460772752, 119897955971096, 546920858309968
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Column 2 of A205255.
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
|
FORMULA
|
Empirical: a(n) = 6*a(n-1) -7*a(n-2) +2*a(n-3).
Empirical g.f.: 8*x*(5 - 9*x + 3*x^2) / ((1 - x)*(1 - 5*x + 2*x^2)). - Colin Barker, Jun 11 2018
|
|
|
EXAMPLE
|
Some solutions for n=4:
..1..1..1....1..0..1....0..0..1....1..1..1....1..1..1....1..1..0....1..1..1
..0..0..1....0..1..0....0..1..1....0..1..0....1..0..1....0..0..0....1..1..1
..1..1..1....1..0..1....1..1..0....0..1..0....1..1..1....0..1..1....1..1..1
..0..1..0....0..1..0....1..0..0....0..1..1....1..0..1....0..1..0....1..1..1
..1..1..1....1..0..1....0..0..1....1..1..0....1..0..0....0..0..0....1..1..1
|
|
|
CROSSREFS
|
Cf. A205255.
Sequence in context: A250592 A250585 A260169 * A211155 A250994 A250995
Adjacent sequences: A205246 A205247 A205248 * A205250 A205251 A205252
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin, Jan 24 2012
|
|
|
STATUS
|
approved
|
| |
|
|
