login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A211732 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, four, five or six distinct values for every i,j,k<=n 1
48, 306, 1016, 2722, 6868, 17054, 41920, 105654, 267306, 699930, 1842080, 5008110, 13630092, 38145758, 106346040, 303695658, 860469558, 2491030532, 7134136098, 20845113942, 60132267140, 176824000698, 512627653118, 1514185540302 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..3....1...-3...-2....0...-1....0....3....3...-3....1....3...-1....2...-3....2
..2...-2...-3....1....2....0...-3....0...-2....0...-1....3....2....1....0....1
..3...-1....1...-2....0...-3...-2....3....3...-1....1....2...-1....0...-3....1
..0...-2....1...-3....2...-2....1....0...-2....0...-1....1....0....3...-3....2
..3...-3...-3....0...-1...-1....2....1...-2...-3....1....2...-1....0...-3....1
..0....0....1....3....2...-2...-1....0....3...-2...-3....2....1....3...-3....0
CROSSREFS
Sequence in context: A215262 A097639 A222773 * A211743 A211752 A211763
KEYWORD
nonn
AUTHOR
R. H. Hardin Apr 20 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 12 19:05 EDT 2024. Contains 371636 sequences. (Running on oeis4.)