The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A251422

Number of length n+2 0..2 arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero
(history; published version)

#4 by R. H. Hardin at Tue Dec 02 17:32:18 EST 2014

STATUS

editing

approved

#3 by R. H. Hardin at Tue Dec 02 17:32:14 EST 2014

LINKS

R. H. Hardin, <a href="/A251422/b251422.txt">Table of n, a(n) for n = 1..210</a>

#2 by R. H. Hardin at Tue Dec 02 17:31:59 EST 2014

NAME

allocated for R. H. Hardin

Number of length n+2 0..2 arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero

DATA

9, 41, 97, 341, 1003, 3129, 9439, 28717, 86695, 261789, 788373, 2372693, 7133179, 21434717, 64377579, 193296317, 580236633, 1741470477, 5226041293, 15681654949, 47052540983, 141173946441, 423556852705, 1270745764685, 3812398439683

OFFSET

1,1

COMMENTS

Column 2 of A251428

FORMULA

Empirical: a(n) = 8*a(n-1) -21*a(n-2) +12*a(n-3) +36*a(n-4) -66*a(n-5) +25*a(n-6) +56*a(n-7) -58*a(n-8) -56*a(n-9) +63*a(n-10) +8*a(n-11) +54*a(n-12) -80*a(n-13) +24*a(n-14)

EXAMPLE

Some solutions for n=9

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

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

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

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

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

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

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

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Dec 02 2014

STATUS

approved

editing

#1 by R. H. Hardin at Tue Dec 02 17:29:23 EST 2014

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved