A281137 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A281137

Number of nX6 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

28, 2528, 10790, 12064, 17592, 29408, 51158, 90312, 164300, 299484, 534922, 932864, 1597694, 2722036, 4651100, 7986172, 13730774, 23553880, 40209394, 68308016, 115641826, 195429924, 330062244, 557160500, 939745112, 1582880844, 2662014908

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Column 6 of A281139.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..141

FORMULA

Empirical: a(n) = 2*a(n-1) +a(n-2) -4*a(n-3) +3*a(n-4) -3*a(n-6) +14*a(n-7) -23*a(n-8) +4*a(n-9) +10*a(n-10) -28*a(n-11) +32*a(n-12) -18*a(n-13) -30*a(n-14) +72*a(n-15) -75*a(n-16) +84*a(n-17) -5*a(n-18) -36*a(n-19) +81*a(n-20) -82*a(n-21) +61*a(n-22) -14*a(n-23) -30*a(n-24) +22*a(n-25) -44*a(n-26) +4*a(n-27) -9*a(n-28) -12*a(n-29) -8*a(n-31) -4*a(n-32) for n>43

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A281139.

Sequence in context: A178187 A184134 A327294 * A100548 A103660 A317799

Adjacent sequences: A281134 A281135 A281136 * A281138 A281139 A281140

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 15 2017

STATUS

approved