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.

A324071 Number of defective (binary) heaps on n elements where ten ancestor-successor pairs do not have the correct order.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 80, 3150, 36736, 359520, 3532800, 36115200, 383708160, 4247443200, 48673996800, 515675160000, 5654852403200, 64785924403200, 788119068672000, 9695238119424000, 125961866477568000, 1700829800017920000, 24580421999198208000
Offset: 0

Views

Author

Alois P. Heinz, Feb 13 2019

Keywords

Comments

Or number of permutations p of [n] having exactly ten pairs (i,j) in {1,...,n} X {1,...,floor(log_2(i))} such that p(i) > p(floor(i/2^j)).

Crossrefs

Column k=10 of A306393.
Cf. A056971.