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.

A212939 Number of nX4 0..3 arrays with no column j greater than or equal to than column j-1 in all rows.

Original entry on oeis.org

1, 10311, 6470341, 2509306671, 801439905901, 232665778445031, 64146409058631061, 17171607076234160991, 4517476409302006541821, 1176061942859281821190551, 304219071898389511351734181
Offset: 1

Views

Author

R. H. Hardin May 31 2012

Keywords

Comments

Column 4 of A212943

Examples

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

Formula

Empirical: a(n) = 631*a(n-1) -144700*a(n-2) +15035200*a(n-3) -702208000*a(n-4) +11468800000*a(n-5).
Empirical: a(n) = 100^n-3*160^n+256^n-35^n+2*80^n. R. J. Mathar, Jun 27 2012