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.

A265656 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal diagonal or antidiagonal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 7, 1, 1, 2, 20, 43, 1, 1, 1, 104, 1129, 372, 1, 1, 2, 476, 39913, 104241, 4027, 1, 1, 1, 2428, 1465545, 35213302, 14031233, 51871, 1, 1, 2, 12362, 56069313, 13162584704, 59232755329, 2641322440, 773186, 1, 1, 1, 64454, 2233380101
Offset: 1

Views

Author

R. H. Hardin, Dec 12 2015

Keywords

Comments

Table starts
.1........1............1...............1...............1.............1
.1........2............1...............2...............1.............2
.1........7...........20.............104.............476..........2428
.1.......43.........1129...........39913.........1465545......56069313
.1......372.......104241........35213302.....13162584704.5195648940117
.1.....4027.....14031233.....59232755329.283609520134103
.1....51871...2641322440.167960505022072
.1...773186.663690698065
.1.13083385

Examples

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

Crossrefs

Column 2 is A265229.
Showing 1-1 of 1 results.