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!)
A211763 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, six, seven or eight distinct values for every i,j,k<=n 0
48, 306, 1732, 9066, 44218, 203952, 901938, 3863236, 16173336, 66608806, 271211310, 1096118176, 4408568100, 17688124818, 70884256140 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..0...-1...-1....0....3....3....2...-3....2....2....2....3...-1....1....1....2
.-3...-3....1...-3....2....3....2...-1....1....0...-2....3....1...-2...-2...-2
..1....3...-2....1....0...-3....3....0....2....3....2....1....2....1...-3...-2
.-3...-3...-2....1....2....2...-1...-3....1...-2....3....2....2....3....1....3
.-1...-3...-3...-3...-2....3...-2...-2...-1...-1...-2....2....1...-3...-2....2
.-2...-3....1...-3....3....1...-1....3....2....3....3....0...-1...-3...-3....2
CROSSREFS
Sequence in context: A211732 A211743 A211752 * A134607 A192215 A347613
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 February 25 13:12 EST 2024. Contains 370330 sequences. (Running on oeis4.)