A026834 a(n) = number of numbers k such that only one partition of n into distinct parts has least part k.

1, 1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 6, 5, 6, 6, 6, 6, 7, 6, 7, 7, 7, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 9, 9, 10, 9, 10, 10, 10, 10, 11, 10, 11, 11, 11, 11, 12, 11, 12, 12, 12, 12, 13, 12, 13, 13, 13, 13, 14, 13, 14, 14, 14, 14, 15, 14, 15, 15, 15, 15, 16

Offset

1,3

Links

Table of n, a(n) for n=1..83.

Formula

a(n) = Sum_{k=1..n} [A026821(n, k) == 1]. - Sean A. Irvine, Oct 14 2019

Crossrefs

Sequence in context: A330808 A097849 A100678 * A071335 A176839 A179844

Adjacent sequences: A026831 A026832 A026833 * A026835 A026836 A026837

Keyword

nonn

Author

Clark Kimberling

Extensions

More terms from Sean A. Irvine, Oct 14 2019

Status

approved