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 A364171 #63 Jul 28 2023 15:52:48
%S A364171 6,21,40,105,126,301,456,657,910,1221,1596,2041,2562,3165,3856,4641,
%T A364171 5526,6517,7620,8841,10186,11661,13272,15025,16926,18981,21196,23577,
%U A364171 26130,28861,31776,34881,38182,41685,45396,49321,53466,57837,62440,67281,72366,77701
%N A364171 a(n) = m is the least m = b*c > a(n-1) such that (b+c)*n = m-1 where 1 < b <= c < m.
%C A364171 Each term is a representative of the class of numbers with quotient n.
%C A364171 A364169 is the smallest m = b*c without requiring an increasing sequence. Sometimes the present sequence is still that minimum, a(n) = A364169(n).
%C A364171 Also subsequence of A364202.
%C A364171 Is a(n) = A062158(n+1) + 1 for n >= 6? - _Hugo Pfoertner_, Jul 23 2023
%e A364171 For n = 7, a(7) = 456 because it is the smallest number m > 301 = a(6) that has a pair of distinct proper divisors b = 8 and c = 57 that give b*c = 8*57 = 456 and (b+c)*n = (8 + 57)*7 = 456 - 1.
%t A364171 f[kmin_, n_] := f[kmin, n] = Module[{k = kmin + 1}, While[PrimeQ[k] || !AnyTrue[Rest@ Divisors[k], #^2 <= k && k - 1 == (# + k/#)*n &], k++]; k]; Rest@ FoldList[f][Join[{5}, Range[50]]] (* _Amiram Eldar_, Jul 12 2023 *)
%Y A364171 Cf. A062158, A364169, A364202.
%K A364171 nonn
%O A364171 1,1
%A A364171 _Jose Aranda_, Jul 12 2023
%E A364171 More terms from _Amiram Eldar_, Jul 12 2023