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.

A269336 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 avoiding the pattern equal-up in every row and column.

Original entry on oeis.org

1, 1, 2, 1, 6, 6, 1, 14, 74, 24, 1, 34, 852, 1880, 120, 1, 78, 10210, 152922, 80316, 720, 1, 178, 124466, 13745475, 62038644, 5141864, 5040, 1, 398, 1539739, 1301306034, 55575194220, 47286888510, 458608016, 40320, 1, 882, 19271229, 128342085219
Offset: 1

Views

Author

R. H. Hardin, Feb 24 2016

Keywords

Comments

Table starts
.....1.........1...........1...........1..............1............1........1
.....2.........6..........14..........34.............78..........178......398
.....6........74.........852.......10210.........124466......1539739.19271229
....24......1880......152922....13745475.....1301306034.128342085219
...120.....80316....62038644.55575194220.54180777470296
...720...5141864.47286888510
..5040.458608016
.40320

Examples

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

Crossrefs

Column 1 is A000142.
Row 2 is A059570(n+1).