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.

Showing 1-1 of 1 results.

A266183 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any diagonal or antidiagonal neighbor equal to n-1.

Original entry on oeis.org

1, 1, 2, 1, 2, 6, 1, 2, 22, 24, 1, 2, 88, 384, 120, 1, 2, 296, 7768, 19080, 720, 1, 2, 1372, 226296, 4027960, 1019328, 5040, 1, 2, 6128, 7089448, 1203241488, 2437859280, 106546608, 40320, 1, 2, 29552, 253282792, 409870443648, 8822224268688
Offset: 1

Views

Author

R. H. Hardin, Dec 23 2015

Keywords

Comments

Table starts
......1...........1.............1.............1............1.........1
......2...........2.............2.............2............2.........2
......6..........22............88...........296.........1372......6128
.....24.........384..........7768........226296......7089448.253282792
....120.......19080.......4027960....1203241488.409870443648
....720.....1019328....2437859280.8822224268688
...5040...106546608.3971117183616
..40320.11075595648
.362880

Examples

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

Crossrefs

Column 1 is A000142.
Column 2 is A265860.
Showing 1-1 of 1 results.