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!)
A211581 Number of -2..2 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 one, two, three, four, five or six distinct values for every i,j,k<=n 1
25, 125, 457, 1353, 3771, 10123, 26785, 70815, 187485, 501357, 1349215, 3674445, 10074585, 27914969, 77778359, 218513889, 616455627, 1749899177, 4982262575, 14249870589, 40844847989, 117464523359, 338353979903, 977015700789 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
.-2....1...-1....0....1...-2...-1....0....1....0....1....1....0...-1....0...-2
.-1....0....0...-1....0....1...-1....0....2....1....1...-1...-1....0....1....0
..0....1...-1....1...-2....0...-1....2....1....2....1....1....1...-1....1...-1
.-2....0...-1...-1....0....1....1....0....0....1....1....0....1...-1....0...-2
..0....0...-2...-2....1....0....1....2...-1....1...-1....0....1....0....0...-1
.-1....0...-1....0....2....0...-1....2...-2....1....1...-1....1....0...-2...-2
CROSSREFS
Sequence in context: A062672 A036321 A289337 * A226231 A211595 A066609
KEYWORD
nonn
AUTHOR
R. H. Hardin Apr 16 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 08:01 EDT 2024. Contains 371265 sequences. (Running on oeis4.)