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.

A216760 T(n,k)=Number of horizontal, vertical, diagonal, antidiagonal or knight-move neighbor colorings of an nXk array with new integer colors introduced in row major order.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 5, 4, 4, 5, 15, 34, 60, 34, 15, 52, 500, 2957, 2957, 500, 52, 203, 10900, 337731, 1340534, 337731, 10900, 203, 877, 322768, 71786149, 1842474893, 1842474893, 71786149, 322768, 877, 4140, 12297768, 24889021634
Offset: 1

Views

Author

R. H. Hardin Sep 15 2012

Keywords

Comments

Table starts
...1......1........2..........5.........15.......52.........203......877.4140
...1......1........4.........34........500....10900......322768.12297768
...2......4.......60.......2957.....337731.71786149.24889021634
...5.....34.....2957....1340534.1842474893
..15....500...337731.1842474893
..52..10900.71786149
.203.322768
.877

Examples

			Some solutions for n=3 k=4
..0..2..5..6....0..3..0..2....0..3..2..3....0..3..6..3....0..3..5..0
..1..3..1..3....1..4..6..4....1..4..5..6....1..4..1..2....1..4..1..2
..0..4..0..4....2..5..7..8....2..3..2..3....2..5..0..7....2..3..5..6
		

Crossrefs

Column 1 is A000110(n-1)
Column 2 is A207864(n-1)