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.

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

Original entry on oeis.org

1, 0, 1, 0, 2, 1, 0, 1, 8, 1, 0, 2, 56, 60, 1, 0, 1, 332, 3201, 544, 1, 0, 2, 2350, 184740, 307016, 6040, 1, 0, 1, 16108, 11375145, 196389904, 43200625, 79008, 1, 0, 2, 114148, 730983420, 137409486772, 368696849320, 8403205056, 1190672, 1, 0, 1, 817280
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Table starts
.1.....0..........0................0.....................0....................0
.1.....2..........1................2.....................1....................2
.1.....8.........56..............332..................2350................16108
.1....60.......3201...........184740..............11375145............730983420
.1...544.....307016........196389904..........137409486772......102117302729744
.1..6040...43200625.....368696849320......3537141103745065.36724170744914466520
.1.79008.8403205056.1122409297218768.173357342638694530002

Examples

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

Crossrefs

Column 2 is A053871.