OFFSET
1,2
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..2000
EXAMPLE
The partitions of 4 are [4], [3,1], [2,2], [2,1,1], [1,1,1,1], with runlengths {1}, {1,1}, {2}, {1,2}, {4} having minima 1, 1, 2, 1, 4, with sum 9, so that a(4) = 9.
MAPLE
b:= proc(n, i, m) option remember; `if`(n=0, m, `if`(i=1, min(m, n),
add(b(n-i*j, i-1, `if`(j=0, m, min(m, j))), j=0..n/i)))
end:
a:= n-> b(n$3):
seq(a(n), n=1..50); # Alois P. Heinz, Sep 17 2023
MATHEMATICA
m[n_] := m[n] = Map[Split, IntegerPartitions[n]]
t[n_] := t[n] = Table[Map[Length, m[n][[k]]], {k, 1, PartitionsP[n]}]
Table[Total[Map[Min, t[n]]], {n, 1, 47}]
PROG
(Python)
from sympy.utilities.iterables import partitions
def A364808(n): return sum(min(p.values()) for p in partitions(n)) # Chai Wah Wu, Sep 17 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Sep 10 2023
STATUS
approved