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.

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

Original entry on oeis.org

0, 0, 0, 2, 6, 24, 100, 480, 1890, 8960, 47040, 288000, 1584000, 10644480, 74131200, 615014400, 3783780000, 29520691200, 230015385600, 2199674880000, 17239951872000, 172890685440000, 1660143513600000, 19778694414336000, 174145223476224000, 2007117934991769600
Offset: 0

Views

Author

Alois P. Heinz, Feb 13 2019

Keywords

Comments

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

Crossrefs

Column k=2 of A306393.
Cf. A056971.