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.

A273754 Number of binary heaps on [n] that give a heap when the first element is removed.

Original entry on oeis.org

1, 1, 1, 2, 3, 8, 18, 70, 180, 770, 2610, 14570, 54720, 330960, 1562814, 11946080, 57126780, 429542960, 2465050968, 22517159760
Offset: 1

Views

Author

Alois P. Heinz, May 29 2016

Keywords

Examples

			There are 3 (min) heaps for n=4: 1234, 1243, 1324.  When the first element is removed only 2 heaps remain: 234, 243.  Thus a(4) = 2.
a(5) = 3: 12345, 12354, 12435.
a(6) = 8: 123456, 123465, 123546, 123564, 123645, 123654, 124356, 124365.
		

Crossrefs