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.

A228619 Number of s in {1,...,n}^n having shortest run with the same value of length one.

Original entry on oeis.org

0, 1, 2, 24, 240, 3080, 46410, 822612, 16771832, 387395856, 9999848700, 285310876620, 8916095279388, 302875076421528, 11112006618140610, 437893889060776260, 18446744064162650880, 827240261820996258848, 39346408074801256997526, 1978419655656704853586044
Offset: 0

Views

Author

Alois P. Heinz, Aug 27 2013

Keywords

Examples

			a(1) = 1: [1].
a(2) = 2: [1,2], [2,1].
a(3) = 24: [1,1,2], [1,1,3], [1,2,1], [1,2,2], [1,2,3], [1,3,1], [1,3,2], [1,3,3], [2,1,1], [2,1,2], [2,1,3], [2,2,1], [2,2,3], [2,3,1], [2,3,2], [2,3,3], [3,1,1], [3,1,2], [3,1,3], [3,2,1], [3,2,2], [3,2,3], [3,3,1], [3,3,2].
		

Crossrefs

Column k=1 of A228617.

Formula

a(n) ~ n^n. - Vaclav Kotesovec, Aug 29 2014