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.

A219142 T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array.

Original entry on oeis.org

1, 2, 1, 4, 6, 1, 7, 18, 18, 1, 12, 39, 78, 51, 1, 21, 96, 281, 331, 142, 1, 37, 225, 1072, 1774, 1400, 405, 1, 65, 543, 4033, 10505, 11385, 5949, 1157, 1, 114, 1293, 15255, 59127, 101600, 73136, 25277, 3289, 1, 200, 3096, 57963, 341648, 872437, 989947
Offset: 1

Views

Author

R. H. Hardin Nov 12 2012

Keywords

Comments

Table starts
.1......2........4..........7..........12...........21............37
.1......6.......18.........39..........96..........225...........543
.1.....18.......78........281........1072.........4033.........15255
.1.....51......331.......1774.......10505........59127........341648
.1....142.....1400......11385......101600.......872437.......7640541
.1....405.....5949......73136......989947.....12867295.....170792866
.1...1157....25277.....472638.....9702349....191707377....3862325048
.1...3289...107353....3050285....94937311...2851740545...87205791997
.1...9344...455938...19667721...927766394..42351530487.1964627314453
.1..26580..1936500..126807809..9067631046.628917557052
.1..75621..8224877..817795362.88653591037
.1.215076.34933256.5274346426

Examples

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

Crossrefs

Row 1 is A005251(n+2)