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.

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

Original entry on oeis.org

1, 1, 2, 1, 6, 4, 1, 14, 54, 8, 1, 34, 420, 600, 16, 1, 92, 3088, 18332, 9102, 32, 1, 258, 25226, 480440, 1261420, 188472, 64, 1, 722, 239994, 13522204, 135988690, 134871120, 5118012, 128, 1, 2022, 2338286, 492613956, 14911788936, 69071316466
Offset: 1

Views

Author

R. H. Hardin, Feb 28 2016

Keywords

Comments

Table starts
...1.........1...........1...........1...........1.........1...........1
...2.........6..........14..........34..........92.......258.........722
...4........54.........420........3088.......25226....239994.....2338286
...8.......600.......18332......480440....13522204.492613956.18677195738
..16......9102.....1261420...135988690.14911788936
..32....188472...134871120.69071316466
..64...5118012.21338020496
.128.172101936
.256

Examples

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

Crossrefs

Column 1 is A000079(n-1).
Column 2 is A269477.
Showing 1-1 of 1 results.