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.

A267629 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 1, 1, 1, 3, 2, 1, 10, 7, 6, 1, 35, 39, 27, 24, 1, 126, 265, 208, 138, 120, 1, 462, 1802, 2386, 1576, 900, 720, 1, 1716, 12239, 32208, 29387, 14830, 7110, 5040, 1, 6435, 84614, 445970, 679735, 469605, 168500, 66150, 40320, 1, 24310, 597601, 6039160, 17761798
Offset: 1

Views

Author

R. H. Hardin, Jan 18 2016

Keywords

Comments

Table starts
......1.......1.........1..........1...........1...........1...........1
......1.......3........10.........35.........126.........462........1716
......2.......7........39........265........1802.......12239.......84614
......6......27.......208.......2386.......32208......445970.....6039160
.....24.....138......1576......29387......679735....17761798...490407156
....120.....900.....14830.....469605....19027506...873319806.44064461220
....720....7110....168500....8889180...651123366.54381881627
...5040...66150...2247280..196362845.25708254936
..40320..708120..34423760.4969038690
.362880.8573040.596248800

Examples

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

Crossrefs

Column 1 is A000142(n-1).
Row 2 is A001700(n-1).
Row 3 is A266310.