login
A211530
Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, five or six distinct values for every i,j,k<=n.
1
8, 22, 56, 124, 270, 560, 1156, 2336, 4714, 9418, 18812, 37400, 74374, 147596, 293042, 581384, 1154070, 2290670, 4549186, 9036466, 17959458, 35705544, 71021240, 141319688, 281322224, 560223850, 1116045988, 2224048908, 4433497296
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 4*a(n-1) - 16*a(n-3) + 11*a(n-4) + 19*a(n-5) - 16*a(n-6) - 6*a(n-7) + 4*a(n-8).
Empirical g.f.: 2*x*(4 - 5*x - 16*x^2 + 14*x^3 + 19*x^4 - 9*x^5 - 3*x^6 + 2*x^7) / ((1 - 2*x)*(1 - x - x^2)*(1 - 2*x^2)*(1 - x - 2*x^2 + x^3)). - Colin Barker, Jul 18 2018
EXAMPLE
Some solutions for n=5:
.-1....0....0...-1....1....1....1...-1....0....1....0...-1...-1...-1...-1....0
.-1....1...-1...-1...-1....0....0...-1....1....0....1....0....0...-1....1...-1
..0....0...-1....0....1....1...-1...-1....0....1...-1....1....1...-1...-1...-1
..1....1....0....1...-1...-1....0...-1....1....1...-1....0....0....1....0....0
..1...-1....1....0....0....1....1...-1....1....1...-1...-1....1....1...-1....1
..0....1....0....1....1....0....0....1....0....0...-1....0....1....1....0....1
CROSSREFS
Sequence in context: A124701 A369593 A002968 * A058404 A350123 A211479
KEYWORD
nonn
AUTHOR
R. H. Hardin, Apr 14 2012
STATUS
approved