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.

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

Original entry on oeis.org

1, 1, 2, 1, 6, 6, 1, 14, 74, 24, 1, 34, 574, 1880, 120, 1, 92, 4564, 68876, 80316, 720, 1, 258, 41526, 2316638, 18375702, 5141864, 5040, 1, 722, 419516, 94747953, 3291772332, 9213264418, 458608016, 40320, 1, 2022, 4351224, 4581555620
Offset: 1

Views

Author

R. H. Hardin, Mar 02 2016

Keywords

Comments

Table starts
......1...........1.............1..............1............1..........1
......2...........6............14.............34...........92........258
......6..........74...........574...........4564........41526.....419516
.....24........1880.........68876........2316638.....94747953.4581555620
....120.......80316......18375702.....3291772332.740782304804
....720.....5141864....9213264418.10673009972228
...5040...458608016.7725775442284
..40320.54247835568
.362880

Examples

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

Crossrefs

Column 1 is A000142.
Column 2 is A269334.
Row 2 is A269506.
Showing 1-1 of 1 results.