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 A350928 #12 Jan 26 2022 02:30:54
%S A350928 3,6,8,12,18,27,54,72,80,85,102,136,204,216,240,250,275,286,299,322,
%T A350928 329,376,470,705,720,736,768,816,867,1156,1734,1836,1872,1898,1971,
%U A350928 2190,2220,2240,2254,2300,2350,2820,2880,2920,3066,3087,3136,3164,3277,3306,3325
%N A350928 {Partial sums of A095258} + 2.
%C A350928 Let A095258(n) = m | a(n) such that m is minimal and distinct in A095258.
%H A350928 Michael De Vlieger, <a href="/A350928/b350928.txt">Table of n, a(n) for n = 1..10000</a>
%H A350928 Michael De Vlieger, <a href="/A350928/a350928.png">Log-log scatterplot of a(n), b(n), and c(n)</a>, n = 1..10^5, where a(n) appears in red, b(n) = A095258(n) in blue, A350929(n) in gold.
%F A350928 a(n) = A095258(n) * A350929(n).
%t A350928 c[_] = 0; j = c[1] = 1; s = 3; Reap[Do[d = Divisors[s]; k = 1; While[c[d[[k]]] > 0, k++]; Set[k, d[[k]]]; Set[c[k], i]; Sow[s]; j = k; s += k, {i, 2, 52}]][[-1, -1]]
%Y A350928 Cf. A095258, A350929.
%K A350928 nonn,easy
%O A350928 1,1
%A A350928 _Michael De Vlieger_, Jan 23 2022