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.
%I A026834 #7 Oct 14 2019 01:22:27
%S A026834 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,
%T A026834 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,
%U A026834 12,12,12,13,12,13,13,13,13,14,13,14,14,14,14,15,14,15,15,15,15,16
%N A026834 a(n) = number of numbers k such that only one partition of n into distinct parts has least part k.
%F A026834 a(n) = Sum_{k=1..n} [A026821(n, k) == 1]. - _Sean A. Irvine_, Oct 14 2019
%K A026834 nonn
%O A026834 1,3
%A A026834 _Clark Kimberling_
%E A026834 More terms from _Sean A. Irvine_, Oct 14 2019