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!)
A211729 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 or six distinct values for every i,j,k<=n 1
48, 230, 674, 1788, 4578, 11854, 30704, 81648, 217702, 595826, 1629412, 4562734, 12717112, 36221068, 102357152, 295195208, 842598926, 2452480406, 7051866394, 20665527346, 59743571278, 175966514172, 510748673328, 1510003478102 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..0....0....1....0...-2...-2....1....2...-1...-3....0....2....1...-3....0....0
..1...-1....0...-1...-2....3....2....1....0...-2....2...-1....3...-3...-3....1
..2....0....1....0....3...-1....2...-2...-1...-1....2....2....1....0....0....2
.-1...-1....1....1...-2....3....3...-3...-1....0....2...-1....3...-3....1....2
..0....2....0...-2....3...-1....3...-2....0...-2....2...-3....0...-3....2....2
..3....1....1...-1...-2...-2....2...-3....3....0....0...-1....3...-3....1....3
CROSSREFS
Sequence in context: A235542 A269014 A265422 * A211738 A211749 A211758
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 25 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)