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.

A216084 T(n,k) = Number of horizontal and antidiagonal neighbor colorings of the odd squares of an n X k array with new integer colors introduced in row major order.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 4, 5, 7, 2, 2, 12, 42, 52, 27, 5, 2, 34, 136, 602, 203, 87, 5, 5, 136, 2440, 12840, 15144, 4140, 409, 15, 5, 500, 10900, 322768, 373780, 433252, 21147, 1657, 15, 15, 2440, 322776, 12297870, 87852160, 99827160, 18378580, 678570, 9089
Offset: 1

Views

Author

R. H. Hardin, Sep 01 2012

Keywords

Comments

Table starts
..1.....1.........1.............1..................1.......................2
..1.....1.........2.............4.................12......................34
..1.....3.........5............42................136....................2440
..2.....7........52...........602..............12840..................322768
..2....27.......203.........15144.............373780................87852160
..5....87......4140........433252...........99827160.............33093252880
..5...409.....21147......18378580.........5116799368..........20358402201792
.15..1657....678570.....839621092......2751754706832.......15604440074084672
.15..9089...4213597...52183667212....212339816996032....17423570614012565376
.52.43833.190899322.3404551437592.194478305002268064.22946861101272125055616

Examples

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

Crossrefs

Column 1 is A000110(floor(n/2)).
Row 2 is A215953.