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.
%I A324063 #7 Feb 16 2025 08:33:57
%S A324063 0,0,0,2,6,24,100,480,1890,8960,47040,288000,1584000,10644480,
%T A324063 74131200,615014400,3783780000,29520691200,230015385600,2199674880000,
%U A324063 17239951872000,172890685440000,1660143513600000,19778694414336000,174145223476224000,2007117934991769600
%N A324063 Number of defective (binary) heaps on n elements where two ancestor-successor pairs do not have the correct order.
%C A324063 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)).
%H A324063 Alois P. Heinz, <a href="/A324063/b324063.txt">Table of n, a(n) for n = 0..200</a>
%H A324063 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Heap.html">Heap</a>
%H A324063 Wikipedia, <a href="https://en.wikipedia.org/wiki/Binary_heap">Binary heap</a>
%H A324063 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>
%Y A324063 Column k=2 of A306393.
%Y A324063 Cf. A056971.
%K A324063 nonn
%O A324063 0,4
%A A324063 _Alois P. Heinz_, Feb 13 2019