login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A209531
Half the number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.
1
33, 193, 1025, 6145, 32769, 196609, 1048577, 6291457, 33554433, 201326593, 1073741825, 6442450945, 34359738369, 206158430209, 1099511627777, 6597069766657, 35184372088833, 211106232532993, 1125899906842625
OFFSET
1,1
COMMENTS
Column 4 of A209534.
LINKS
FORMULA
Empirical: a(n) = a(n-1) + 32*a(n-2) - 32*a(n-3).
Conjectures from Colin Barker, Jul 11 2018: (Start)
G.f.: x*(33 + 160*x - 224*x^2) / ((1 - x)*(1 - 32*x^2)).
a(n) = 3*2^((5*n)/2 + 1) + 1 for n even.
a(n) = 2^((5*(n + 1))/2) + 1 for n odd.
(End)
EXAMPLE
Some solutions for n=4:
..0..1..2..1..2....0..2..0..2..0....1..0..1..2..1....0..1..2..1..2
..1..0..1..2..1....2..0..2..0..2....2..1..2..1..0....1..0..1..2..1
..2..1..0..1..2....0..2..0..2..0....1..2..1..2..1....2..1..2..1..2
..1..2..1..2..1....2..0..2..0..2....2..1..2..1..2....1..0..1..2..1
..0..1..0..1..2....0..2..0..2..0....1..0..1..2..1....2..1..2..1..2
CROSSREFS
Cf. A209534.
Sequence in context: A046142 A135827 A189180 * A127870 A142993 A230186
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 10 2012
STATUS
approved