The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A211587

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

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, three, four, five, six or seven distinct values for every i,j,k<=n
(history; published version)

#4 by R. H. Hardin at Mon Apr 16 07:00:42 EDT 2012

STATUS

editing

approved

#3 by R. H. Hardin at Mon Apr 16 07:00:38 EDT 2012

LINKS

R. H. Hardin, <a href="/A211587/b211587.txt">Table of n, a(n) for n = 1..51</a>

#2 by R. H. Hardin at Mon Apr 16 07:00:22 EDT 2012

NAME

allocated for R. H. Hardin

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, three, four, five, six or seven distinct values for every i,j,k<=n

DATA

17, 61, 213, 705, 2293, 7235, 22491, 68737, 207725, 621607, 1846229, 5452449, 16029207, 46976949, 137331695, 400884837, 1168925307, 3406992747, 9928127547, 28937875373, 84376984733, 246182651755, 718778819599, 2100421491357

OFFSET

1,1

EXAMPLE

Some solutions for n=5

..2....2...-1...-2...-2...-1...-1....1....1...-2....0...-1....2...-2....0....2

..0....0....0...-1....0....0....0...-2...-2...-1....0....2...-1....0...-2....0

..2...-2....2....0...-2...-2...-2....0....1...-2....0...-1....0...-1....0...-1

..0...-1...-1....2....1....0...-1....1....0....0....0...-2....1....2....1...-2

..2....2....2...-1....0....2....0....0....0...-1....1....0...-2...-1....0....0

..1...-1....0....0...-2....1....2...-1....2....2....2...-2....1....0....2....1

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin Apr 16 2012

STATUS

approved

editing

#1 by R. H. Hardin at Mon Apr 16 06:36:28 EDT 2012

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved