STATUS
editing
approved
editing
approved
Alois P. Heinz, <a href="/A373608/b373608_1.txt">Table of n, a(n) for n = 0..495</a>
editing
approved
a(n) = max({ A373451(n,k) : 0 <= k <= n }).
a(7) = 502: 5141123, 5141132, 5241113, 5241123, 5241131, 5241132, 5241133, ..., 5553421, 5554123, 5554132, 5554213, 5554231, 5554312, 5554321 (with k=5).
a(6) = 92: 413112, 423111, 423112, 423113, 423121, 423122, 423123, ..., 443421, 444123, 444132, 444213, 444231, 444312, 444321 (with k=4).
(The examples use max-heaps.)
a(4) = 7: 3121, 3211, 3212, 3221, 3231, 3312, 3321 (with k=3).
These heaps may contain repeated elements. Their element sets are gap-free and contain 1 (if nonempty).