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.

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

Original entry on oeis.org

1, 2, 2, 4, 11, 4, 7, 35, 35, 7, 12, 108, 195, 108, 12, 21, 337, 1028, 1028, 337, 21, 37, 1049, 5529, 8961, 5529, 1049, 37, 65, 3268, 29593, 80692, 80692, 29593, 3268, 65, 114, 10179, 158648, 720305, 1229783, 720305, 158648, 10179, 114, 200, 31707, 850155
Offset: 1

Views

Author

R. H. Hardin Nov 06 2012

Keywords

Comments

Table starts
...1......2........4.........7.........12..........21..........37...........65
...2.....11.......35.......108........337........1049........3268........10179
...4.....35......195......1028.......5529.......29593......158648.......850155
...7....108.....1028......8961......80692......720305.....6449353.....57696032
..12....337.....5529.....80692....1229783....18519049...280040904...4229571209
..21...1049....29593....720305...18519049...468783431.11931365309.303182474797
..37...3268...158648...6449353..280040904.11931365309
..65..10179...850155..57696032.4229571209
.114..31707..4556371.516297052
.200..98764.24418812
.351.307641
.616

Examples

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

Crossrefs

Column 1 is A005251(n+2)
Column 2 is A052550(n+1)
Column 3 is A184200(n-1)