OFFSET
1,1
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..210
Index entries for linear recurrences with constant coefficients, signature (4,-4,-1,2).
FORMULA
a(n) = 4*a(n-1) - 4*a(n-2) - a(n-3) + 2*a(n-4).
G.f.: 2*x*(81 - 209*x + 31*x^2 + 128*x^3) / ((1 - x)*(1 - 2*x)*(1 - x - x^2)). - Colin Barker, Dec 24 2018
From the above formulae, a(n) = 2*(2^n + 16*Fibonacci(n+3) + 31). - Ehren Metcalfe, Dec 27 2018
EXAMPLE
Some solutions for n=4:
0 1 0 1 0 1 0 0 1 1 1 0 1 1 1 1 0 0 1 1 1
0 1 0 1 0 1 0 1 0 0 0 1 0 0 0 0 1 1 0 0 0
0 1 0 1 0 1 0 1 0 0 0 1 0 0 1 1 0 0 1 1 1
0 1 0 1 0 1 0 0 1 1 1 0 1 1 0 0 1 1 0 0 0
1 0 1 0 1 0 1 1 0 0 0 1 0 0 1 1 0 0 1 1 1
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
R. H. Hardin, Jun 21 2015
STATUS
approved