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.

A268258 Number of length-(n+1) 0..5 arrays with new repeated values introduced in sequential order starting with zero.

Original entry on oeis.org

31, 161, 837, 4357, 22710, 118530, 619490, 3242265, 16993552, 89197862, 468891563, 2468601733, 13016765331, 68745010766, 363645146551, 1926748983131, 10225750976768, 54362543336048, 289501143028324, 1544393456553619
Offset: 1

Views

Author

R. H. Hardin, Jan 29 2016

Keywords

Comments

Column 5 of A268261.

Examples

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

Crossrefs

Cf. A268261.

Formula

Empirical: a(n) = 31*a(n-1) -390*a(n-2) +2490*a(n-3) -7960*a(n-4) +8610*a(n-5) +11775*a(n-6) -18175*a(n-7) -22024*a(n-8) -7236*a(n-9) -720*a(n-10)