# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a211597
Showing 1-1 of 1

%I A211597 #4 Apr 16 2012 07:08:50
%S A211597 24,80,246,716,2046,5782,16184,45312,126250,353302,986696,2770910,
%T A211597 7777304,21945496,61932032,175572572,497905408,1417135306,4034892052,
%U A211597 11520180346,32901609502,94162093264,269546074004,772772054834
%N A211597 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 two, three, four, six, seven or eight distinct values for every i,j,k<=n
%H A211597 R. H. Hardin, <a href="/A211597/b211597.txt">Table of n, a(n) for n = 1..33</a>
%e A211597 Some solutions for n=5
%e A211597 ..1....2....2....1...-1....0....1...-1....0....0....2...-1...-2....1...-2....2
%e A211597 ..1....1....0...-2...-2....2....2...-2....1....1...-1....1...-2...-1....1....1
%e A211597 ..2....1....2...-1....1....2....2...-2...-2....0....2...-1....2...-1....1....0
%e A211597 ..1....2....1...-2....1....2....1...-1....1...-1....1...-1....2....1....1....2
%e A211597 ..1....0....2....1...-2....0....2....2....2....0...-2....1....2....1...-2....0
%e A211597 ..1....1....1...-2....1....1....0...-1....2...-1....1...-1....2...-1....1....2
%K A211597 nonn
%O A211597 1,1
%A A211597 _R. H. Hardin_ Apr 16 2012

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE