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.

A267901 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.

Original entry on oeis.org

0, 1, 0, 1, 2, 0, 1, 3, 6, 0, 1, 11, 20, 30, 0, 1, 29, 268, 138, 192, 0, 1, 93, 2324, 17658, 1488, 1560, 0, 1, 268, 28318, 414138, 1696920, 20400, 15120, 0, 1, 842, 315196, 28493946, 134764368, 273460560, 317520, 171360, 0, 1, 2547, 3786836, 1246334388
Offset: 1

Views

Author

R. H. Hardin, Jan 22 2016

Keywords

Comments

Table starts
.0......1......1.........1.........1........1..........1.......1....1.1
.0......2......3........11........29.......93........268.....842.2547
.0......6.....20.......268......2324....28318.....315196.3786836
.0.....30....138.....17658....414138.28493946.1246334388
.0....192...1488...1696920.134764368
.0...1560..20400.273460560
.0..15120.317520
.0.171360
.0

Examples

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

Crossrefs

Column 2 is A005922(n-1).