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!)
A211731 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 four, five or six distinct values for every i,j,k<=n 1
36, 170, 532, 1458, 3800, 10014, 26052, 70202, 188180, 522042, 1439540, 4085606, 11496000, 33144154, 94513280, 275391210, 792226416, 2325106662, 6728275612, 19846394074, 57663996620, 170698669690, 497380837436, 1476128070406 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..2....3...-2....0....0....2...-2...-3...-1....3....2...-3...-3...-3...-3...-3
..3....1....1....2....1...-1...-3....1....0...-1....0...-1....2....1....2...-1
..0....2....0....3....3...-2....2...-3...-2....3....3...-3...-3...-3....1...-3
..3....0...-1....2....1....1....1....2....0....1....0...-2....0....1...-3...-1
..2....1....2....1....2...-2....2...-3...-2....3...-3....0...-3....2....2....2
..3....0....3....0....1....1....1....2....0....1....0...-2....2....3...-3....1
CROSSREFS
Sequence in context: A231972 A330770 A166708 * A211742 A211751 A211762
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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)