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.

A295915 Number of nX5 0..1 arrays with each 1 adjacent to 0 or 3 king-move neighboring 1s.

Original entry on oeis.org

13, 60, 337, 1880, 10290, 56955, 314044, 1732883, 9562608, 52762665, 291142893, 1606482609, 8864368984, 48912478517, 269892775507, 1489234149184, 8217404544373, 45342593611494, 250194667755280, 1380542367891973
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2017

Keywords

Comments

Column 5 of A295918.

Examples

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

Crossrefs

Cf. A295918.

Formula

Empirical: a(n) = 3*a(n-1) +15*a(n-2) +102*a(n-3) -342*a(n-4) -1512*a(n-5) -3295*a(n-6) +13427*a(n-7) +47860*a(n-8) +42567*a(n-9) -240345*a(n-10) -621149*a(n-11) -140019*a(n-12) +1975855*a(n-13) +3017471*a(n-14) -1228175*a(n-15) -5445207*a(n-16) -1693493*a(n-17) +6520443*a(n-18) -6122855*a(n-19) -3746602*a(n-20) +5507184*a(n-21) +2158920*a(n-22) +5052409*a(n-23) -2505685*a(n-24) -15612775*a(n-25) -6104943*a(n-26) +16537300*a(n-27) -1244574*a(n-28) -2319152*a(n-29) -483988*a(n-30) +1004084*a(n-31) -258602*a(n-32) -120112*a(n-33) +129320*a(n-34) +67468*a(n-35) +4144*a(n-36) -21040*a(n-37) -4240*a(n-38)