cp's OEIS Frontend

A326511 Number of (binary) max-heaps on n elements from the set {0,1} containing exactly ten 0's.

%I A326511 #12 Feb 16 2025 08:33:58
%S A326511 1,1,2,5,13,26,47,86,151,277,460,783,1248,2136,3091,4872,7166,11610,
%T A326511 15720,23832,32847,50788,64714,94916,124296,185246,226976,324586,
%U A326511 407824,589416,699010,977912,1188567,1674431,1938526,2661055,3147865,4338414,4923481
%N A326511 Number of (binary) max-heaps on n elements from the set {0,1} containing exactly ten 0's.
%H A326511 Alois P. Heinz, <a href="/A326511/b326511.txt">Table of n, a(n) for n = 10..10000</a>
%H A326511 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Heap.html">Heap</a>
%H A326511 Wikipedia, <a href="https://en.wikipedia.org/wiki/Binary_heap">Binary heap</a>
%H A326511 <a href="/index/Rec#order_53">Index entries for linear recurrences with constant coefficients</a>, signature (1, 2, -2, 3, -3, -8, 8, 2, -2, 4, -4, -14, 14, 24, -24, 5, -5, -34, 34, 25, -25, -16, 16, -20, 20, 56, -56, -20, 20, -16, 16, 25, -25, -34, 34, 5, -5, 24, -24, -14, 14, 4, -4, 2, -2, -8, 8, 3, -3, 2, -2, -1, 1).
%p A326511 b:= proc(n) option remember; series(`if`(n=0, 1, (g-> (f->
%p A326511       x^n+b(f)*b(n-1-f))(min(g-1, n-g/2)))(2^ilog2(n))), x, 11)
%p A326511     end:
%p A326511 a:= n-> coeff(b(n), x, 10):
%p A326511 seq(a(n), n=10..50);
%Y A326511 Column k=10 of A309049.
%K A326511 nonn,easy
%O A326511 10,3
%A A326511 _Alois P. Heinz_, Jul 09 2019