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.

A183446 Number of nX5 binary arrays with every 1 having exactly two king-move neighbors equal to 1.

Original entry on oeis.org

1, 33, 107, 283, 2054, 9208, 34867, 176949, 833001, 3619285, 16979210, 79536106, 362125386, 1678147584, 7816357207, 36107427015, 167380756056, 778109691292, 3610178963149, 16759752441151, 77893373268254, 361906632299828
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Column 5 of A183450

Examples

			Some solutions for 7X5
..0..1..1..0..0....0..0..0..0..0....0..0..0..1..1....0..0..0..0..0
..1..0..0..1..0....0..1..0..0..0....1..1..0..1..0....0..0..0..0..0
..0..1..1..0..0....1..1..0..1..0....1..0..0..0..0....0..1..0..0..0
..0..0..0..0..0....0..0..0..1..1....0..0..0..0..0....1..1..0..0..0
..1..0..0..0..0....1..1..0..0..0....0..0..0..0..0....0..0..0..0..0
..1..1..0..1..1....0..1..0..0..1....1..0..0..1..0....0..1..0..0..0
..0..0..0..1..0....0..0..0..1..1....1..1..0..1..1....0..1..1..0..0
		

Formula

Empirical: a(n)=6*a(n-1)-4*a(n-2)+26*a(n-3)-181*a(n-4)-17*a(n-5)+101*a(n-6)+1148*a(n-7)-826*a(n-8)+575*a(n-9)-429*a(n-10)-160*a(n-11)-83*a(n-12)-913*a(n-13)-799*a(n-14)+405*a(n-15)+185*a(n-16)+74*a(n-17)-8*a(n-18)-33*a(n-19)+6*a(n-20)