The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026834 a(n) = number of numbers k such that only one partition of n into distinct parts has least part k. 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS 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 EXTENSIONS More terms from Sean A. Irvine, Oct 14 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 11 13:21 EDT 2021. Contains 343791 sequences. (Running on oeis4.)