login

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”).

A269050
Number of n X 6 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.
1
336, 3288, 58752, 971844, 15547380, 242861616, 3726221592, 56376679620, 843461153880, 12504078167988, 183960496250712, 2689028139554232, 39089999874219540, 565531265339620620, 8147584788387401052
OFFSET
1,1
COMMENTS
Column 6 of A269052.
LINKS
FORMULA
Empirical: a(n) = 36*a(n-1) -436*a(n-2) +1854*a(n-3) +340*a(n-4) -19128*a(n-5) +23849*a(n-6) +56184*a(n-7) -108224*a(n-8) -40816*a(n-9) +160400*a(n-10) -34136*a(n-11) -83203*a(n-12) +42628*a(n-13) +6468*a(n-14) -6334*a(n-15) +204*a(n-16) +240*a(n-17) -25*a(n-18) for n>19.
EXAMPLE
Some solutions for n=3
..0..0..0..1..0..1. .1..2..1..2..1..0. .2..2..1..0..1..0. .1..0..0..0..0..1
..0..1..0..1..2..1. .2..2..1..2..1..0. .1..2..1..2..1..2. .0..0..1..0..1..0
..0..1..0..1..2..2. .1..2..2..0..1..2. .2..2..1..0..1..2. .1..0..1..0..1..2
CROSSREFS
Cf. A269052.
Sequence in context: A268807 A159206 A251066 * A184557 A337873 A337875
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 18 2016
STATUS
approved