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.

A373897 Number of (binary) heaps of length n-k whose element set equals [k], where k is chosen so as to maximize this number.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 3
6 5
7 9
8 23
9 55
10 147
11 386
12 1004
13 3128
14 8113
15 27456
16 111574
17 321433
18 1150885
19 4888981
20 17841912
21 80566518
22 332583340
23 1188065665
24 5473922425
25 21725492503
26 99894124075
27 548452369329
28 2185136109838
29 11339193480666
30 59140581278157
31 288137011157366

List of values

[1, 0, 1, 1, 1, 3, 5, 9, 23, 55, 147, 386, 1004, 3128, 8113, 27456, 111574, 321433, 1150885, 4888981, 17841912, 80566518, 332583340, 1188065665, 5473922425, 21725492503, 99894124075, 548452369329, 2185136109838, 11339193480666, 59140581278157, 288137011157366]