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.

A183450 T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.

Original entry on oeis.org

1, 1, 1, 1, 5, 1, 1, 9, 9, 1, 1, 13, 18, 13, 1, 1, 33, 30, 30, 33, 1, 1, 69, 107, 72, 107, 69, 1, 1, 121, 265, 283, 283, 265, 121, 1, 1, 253, 553, 831, 2054, 831, 553, 253, 1, 1, 529, 1505, 2399, 9208, 9208, 2399, 1505, 529, 1, 1, 1013, 3852, 7761, 34867, 53608, 34867, 7761
Offset: 1

Views

Author

R. H. Hardin Jan 04 2011

Keywords

Comments

Table starts
.1....1....1.....1.......1........1..........1...........1............1
.1....5....9....13......33.......69........121.........253..........529
.1....9...18....30.....107......265........553........1505.........3852
.1...13...30....72.....283......831.......2399........7761........23840
.1...33..107...283....2054.....9208......34867......176949.......833001
.1...69..265...831....9208....53608.....257733.....1817225.....11414889
.1..121..553..2399...34867...257733....1744887....16192521....132651622
.1..253.1505..7761..176949..1817225...16192521...216103851...2491241396
.1..529.3852.23840..833001.11414889..132651622..2491241396..39184763856
.1.1013.8922.72396.3619285.65073225.1038281076.26807184942.568464533358

Examples

			Some solutions for 6X5
..0..1..0..0..0....1..1..0..1..1....1..1..0..0..1....0..0..0..1..1
..1..0..1..0..0....0..1..0..1..0....1..0..0..1..1....0..0..0..1..0
..1..0..1..0..0....0..0..0..0..0....0..0..0..0..0....0..1..0..0..0
..1..0..0..1..0....0..0..1..1..0....0..0..0..1..1....1..0..1..0..0
..0..1..0..1..0....0..1..0..0..1....1..1..0..0..1....1..0..1..0..0
..0..0..1..0..0....0..0..1..1..0....1..0..0..0..0....0..1..0..0..0
		

Crossrefs

Column 2 is A089977(n+1)