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.

A267966 T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row and column greater than the previous repeated value.

Original entry on oeis.org

3, 9, 9, 24, 81, 24, 63, 576, 576, 63, 159, 3969, 9750, 3969, 159, 394, 25281, 157182, 157182, 25281, 394, 957, 155236, 2253828, 5843562, 2253828, 155236, 957, 2292, 915849, 30649446, 185900905, 185900905, 30649446, 915849, 2292, 5419, 5253264
Offset: 1

Views

Author

R. H. Hardin, Jan 22 2016

Keywords

Comments

Table starts
.....3.........9...........24.............63..............159...............394
.....9........81..........576...........3969............25281............155236
....24.......576.........9750.........157182..........2253828..........30649446
....63......3969.......157182........5843562........185900905........5520230601
...159.....25281......2253828......185900905......12628574785......788980366553
...394....155236.....30649446.....5520230601.....788980366553...102223499117744
...957....915849....392792334...151596664089...44750006935212.11810588915957470
..2292...5253264...4834114074..3948855568663.2380009487628460
..5419..29365561..57285557832.97889332200024
.12678.160731684.658558589712

Examples

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

Formula

Empirical for column k:
k=1: a(n) = 6*a(n-1) -9*a(n-2) -8*a(n-3) +24*a(n-4) -16*a(n-6)
k=2: [order 15]
k=3: [order 60]