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.

A219410 T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..2 nXk array.

Original entry on oeis.org

1, 2, 1, 4, 7, 1, 7, 28, 21, 1, 12, 98, 181, 65, 1, 21, 351, 1199, 1180, 200, 1, 37, 1261, 8173, 14737, 7687, 616, 1, 65, 4523, 57097, 193116, 181089, 50077, 1897, 1, 114, 16233, 398375, 2633596, 4560446, 2225293, 326233, 5842, 1, 200, 58268, 2773933
Offset: 1

Views

Author

R. H. Hardin Nov 19 2012

Keywords

Comments

Table starts
.1......2..........4............7.............12..............21
.1......7.........28...........98............351............1261
.1.....21........181.........1199...........8173...........57097
.1.....65.......1180........14737.........193116.........2633596
.1....200.......7687.......181089........4560446.......121641579
.1....616......50077......2225293......107701719......5618116265
.1...1897.....326233.....27345143.....2543481662....259468310384
.1...5842....2125270....336026564....60067211485..11983486642214
.1..17991...13845268...4129209727..1418553120783.553453107750115
.1..55405...90196219..50741147949.33500701298909
.1.170625..587591326.623524656508
.1.525456.3827916001

Examples

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

Crossrefs

Column 2 is A218836
Row 1 is A005251(n+2)