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.

A271754 Number of set partitions of [n+3] such that n is the largest element of the last block.

Original entry on oeis.org

0, 1, 10, 63, 365, 2110, 12521, 77133, 495408, 3321545, 23241681, 169563944, 1288195931, 10176462413, 83473288546, 709925146315, 6251616698625, 56926598141054, 535352734428349, 5193455071192121, 51913950093082800, 534160387907563869, 5651905462025615573
Offset: 1

Views

Author

Alois P. Heinz, Apr 13 2016

Keywords

Examples

			a(3) = 10: 12456|3, 1456|23, 1456|2|3, 145|26|3, 146|25|3, 14|256|3, 156|24|3, 15|246|3, 16|245|3, 1|2456|3.
		

Crossrefs

A diagonal of A271466.

Formula

a(n) = A271466(n+3,n).