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.

A221290 T(n,k) = Equals two maps: number of n X k binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 n X k array.

Original entry on oeis.org

1, 1, 1, 2, 4, 1, 4, 16, 12, 1, 7, 52, 92, 37, 1, 12, 200, 673, 556, 114, 1, 21, 792, 5912, 9107, 3332, 351, 1, 37, 3080, 48298, 172904, 123958, 19996, 1081, 1, 65, 12164, 396846, 2890017, 4983598, 1686304, 119972, 3329, 1, 114, 47827, 3240527, 49684593
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2013

Keywords

Comments

Table starts
.1.....1.......2.........4..........7..........12.........21........37
.1.....4......16........52........200.........792.......3080.....12164
.1....12......92.......673.......5912.......48298.....396846...3240527
.1....37.....556......9107.....172904.....2890017...49684593.821323042
.1...114....3332....123958....4983598...172905144.6138441061
.1...351...19996...1686304..143511784.10344276279
.1..1081..119972..22931365.4129628435
.1..3329..719836.311813067
.1.10252.4319012
.1.31572
.1

Examples

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

Crossrefs

Column 2 is A099098.
Column 3 is A220932.
Column 4 is A220933.
Row 1 is A005251(n+1).
Row 2 is A220936.