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.

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

Original entry on oeis.org

1, 1, 0, 1, 2, 2, 1, 0, 22, 8, 1, 6, 152, 384, 48, 1, 0, 1462, 22016, 19080, 240, 1, 20, 13772, 1584088, 11544576, 1019328, 1968, 1, 0, 139144, 124214208, 8616332520, 7521762432, 106546608, 13824, 1, 70, 1431824, 10318543104, 7213744082208
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2015

Keywords

Comments

Table starts
......1...........1..............1..............1.............1
......0...........2..............0..............6.............0
......2..........22............152...........1462.........13772
......8.........384..........22016........1584088.....124214208
.....48.......19080.......11544576.....8616332520.7213744082208
....240.....1019328.....7521762432.71643177829872
...1968...106546608.11355242996304
..13824.11075595648
.140160

Examples

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

Crossrefs

Column 1 is A173841.
Row 2 is A126869.