A303805 - 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

A303805

Number of nX5 0..1 arrays with every element unequal to 0, 1, 3 or 4 king-move adjacent elements, with upper left element zero.

8, 35, 27, 55, 100, 174, 291, 588, 1163, 2423, 4818, 10036, 21078, 46341, 100336, 220565, 483545, 1084948, 2439934, 5530868, 12512771, 28535002, 65311019, 150358763, 346493586, 800958988, 1855292658, 4311716221, 10037969764

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

OFFSET

1,1

COMMENTS

Column 5 of A303808.

LINKS

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

FORMULA

Empirical: a(n) = 5*a(n-1) -7*a(n-2) -a(n-3) +21*a(n-4) -51*a(n-5) +35*a(n-6) +10*a(n-7) -16*a(n-8) +59*a(n-9) +22*a(n-10) -63*a(n-11) -75*a(n-12) +218*a(n-13) -298*a(n-14) +2*a(n-15) -294*a(n-16) -277*a(n-17) +523*a(n-18) +265*a(n-19) +445*a(n-20) +109*a(n-21) -627*a(n-22) +233*a(n-23) +267*a(n-24) -189*a(n-25) -45*a(n-26) -202*a(n-27) +339*a(n-28) +275*a(n-29) -448*a(n-30) -292*a(n-31) -146*a(n-32) +56*a(n-33) +172*a(n-34) +48*a(n-35) +46*a(n-36) +4*a(n-37) -14*a(n-39) -12*a(n-40) +3*a(n-41) +a(n-42) for n>46

EXAMPLE

Some solutions for n=5

..0..1..1..1..0. .0..1..1..1..1. .0..0..1..1..0. .0..0..1..1..1

..1..1..1..1..1. .1..1..1..1..1. .0..1..1..1..1. .0..0..0..1..1

..1..1..1..1..1. .1..1..1..1..1. .1..1..1..1..1. .0..0..0..0..1

..1..1..1..1..0. .0..1..1..1..1. .1..1..1..1..0. .1..0..0..0..0

..0..1..1..0..0. .0..0..1..1..0. .0..1..1..0..0. .1..1..0..0..0

CROSSREFS

Cf. A303808.

Sequence in context: A280395 A158991 A265161 * A360658 A304852 A305249

Adjacent sequences: A303802 A303803 A303804 * A303806 A303807 A303808

KEYWORD

nonn

AUTHOR

R. H. Hardin, Apr 30 2018

STATUS

approved