cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A282645 Number of nX6 0..1 arrays with no 1 equal to more than one of its king-move neighbors.

Original entry on oeis.org

44, 537, 6349, 92817, 1190848, 15985259, 213392087, 2835418176, 37825158151, 503735487244, 6711044113622, 89413790513675, 1191164876678376, 15869551906444182, 211421699271324253, 2816663462666267647
Offset: 1

Views

Author

R. H. Hardin, Feb 20 2017

Keywords

Comments

Column 6 of A282647.

Examples

			Some solutions for n=4
..0..0..1..0..1..0. .1..0..0..0..0..0. .0..0..0..1..0..0. .0..0..0..1..0..1
..1..0..1..0..0..0. .0..0..0..1..0..0. .1..1..0..0..0..0. .0..1..0..0..0..1
..1..0..0..0..1..1. .1..0..0..0..0..0. .0..0..0..1..0..1. .0..1..0..0..0..0
..0..0..0..0..0..0. .0..0..0..1..1..0. .1..0..0..1..0..1. .0..0..0..1..1..0
		

Crossrefs

Cf. A282647.

Formula

Empirical: a(n) = 4*a(n-1) +79*a(n-2) +607*a(n-3) +266*a(n-4) -2548*a(n-5) -26560*a(n-6) +34049*a(n-7) -173917*a(n-8) +713268*a(n-9) -558487*a(n-10) +1834672*a(n-11) -3966758*a(n-12) -328020*a(n-13) -5705577*a(n-14) +9446395*a(n-15) +5808617*a(n-16) +12366945*a(n-17) -8694968*a(n-18) -13760206*a(n-19) -12750065*a(n-20) +9273034*a(n-21) +11373048*a(n-22) +1026632*a(n-23) -7957231*a(n-24) -2757451*a(n-25) +2239571*a(n-26) +1981049*a(n-27) -71634*a(n-28) -319923*a(n-29) -48708*a(n-30)