A211750 - OEIS

A211750

Number of -3..3 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, six or eight distinct values for every i,j,k<=n

48, 238, 990, 3764, 13830, 49722, 176928, 629352, 2235852, 8002034, 28683258, 103771062, 376062560, 1374796560, 5031081278, 18549468152, 68412809246, 253875030476, 941922579066, 3512298224194, 13090258692986, 48987088758646

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..49

EXAMPLE

Some solutions for n=5

..2...-3...-3...-3....2....1....0...-1....2....2...-3....1....2...-1...-2....1

..3....0....1....2...-3...-1...-3...-3....2....1....0....1....1...-2....1....2

.-2...-1...-3...-3...-2...-1....2....0....1....2....1...-1...-2...-3....2...-1

..1...-1....1....0....3...-1....3...-1....2....1....0....1....1....0....3...-2

.-2...-3...-3...-2....0....1....2...-1....1....2....1...-1....0...-1....2....3