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.

A268142 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one diagonal or antidiagonal neighbor and the top left element equal to 0.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 3, 0, 6, 0, 0, 5, 8, 6, 0, 0, 0, 12, 32, 672, 0, 120, 0, 0, 26, 238, 4734, 5760, 120, 0, 0, 0, 60, 1488, 177048, 218880, 1411560, 0, 5040, 0, 0, 143, 9778, 4131792, 59028840, 97608120, 25024320, 5040, 0, 0, 0, 353, 91628, 132137160
Offset: 1

Views

Author

R. H. Hardin, Jan 27 2016

Keywords

Comments

Table starts
.0....0....0........0........0........0.......0.........0.....0...0.0
.0....1....1........3........5.......12......26........60...143.353
.0....0....0........8.......32......238....1488......9778.91628
.0....6....6......672.....4734...177048.4131792.132137160
.0....0....0.....5760...218880.59028840
.0..120..120..1411560.97608120
.0....0....0.25024320
.0.5040.5040
.0....0
.0

Examples

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

Crossrefs

Column 2 and column 3 are A005212(n-1).
Row 2 is A267725.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.