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!)
A211595 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, six or eight distinct values for every i,j,k<=n 1
25, 125, 513, 1761, 5489, 16203, 46083, 128451, 352585, 961381, 2606233, 7062319, 19117091, 51884109, 141012935, 384802181, 1052871153, 2893966015, 7980178693, 22106320631, 61443947479, 171516628195, 480331192429, 1350382485499 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
Some solutions for n=5
..0...-1...-2....2....0...-1....1....1...-2...-2...-2...-1....2...-1....2....1
..0...-2...-2....1...-1....1....1....2...-2....2....1...-1...-2....0....2....1
..0...-2...-2....2....0....0....0...-2...-1....2...-2....1...-2...-1....2....2
.-2...-1....0....0....0....0....1....2....1...-2....1...-1...-1...-2....0....2
.-1....0...-2....1...-1....0....2...-2....2....0....1...-1....1....0....1....2
.-2...-1...-2....0...-2....0....1...-1....1...-2....1...-2...-1....2....0....0
CROSSREFS
Sequence in context: A289337 A211581 A226231 * A066609 A074006 A073963
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 September 16 17:19 EDT 2024. Contains 375976 sequences. (Running on oeis4.)