The On-Line Encyclopedia of Integer Sequences (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

A298225 revision #3

A298225

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

3, 4, 5, 17, 12, 100, 219, 498, 1999, 4953, 13928, 45164, 120865, 355474, 1065723, 2987665, 8792232, 25703174, 73648001, 215508142, 625811209, 1809121989, 5271819208, 15292192284, 44347119815, 128947618162, 374125557341

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

OFFSET

1,1

COMMENTS

Column 3 of A298230.

LINKS

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

FORMULA

Empirical: a(n) = a(n-1) +4*a(n-2) +13*a(n-3) -14*a(n-4) -29*a(n-5) -23*a(n-6) +29*a(n-7) +56*a(n-8) -30*a(n-9) -7*a(n-10) +41*a(n-11) +2*a(n-12) -26*a(n-13) -12*a(n-14) -15*a(n-15) -7*a(n-16) +16*a(n-17) +2*a(n-18) for n>19

EXAMPLE

Some solutions for n=7

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

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

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

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

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

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

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

CROSSREFS

Cf. A298230.

Sequence in context: A031199 A173027 A290014 * A278919 A173061 A174326

Adjacent sequences: A298222 A298223 A298224 * A298226 A298227 A298228

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 15 2018

STATUS

editing