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 A359072 #15 Feb 12 2023 16:31:28
%S A359072 1,1,2,2,2,2,6,3,3,3,6,6,6,6,12,12,12,12,12,12,12,12,12,12,12,4,4,4,4,
%T A359072 4,20,20,20,20,20,20,20,20,60,60,60,60,60,60,60,60,30,15,30,30,15,15,
%U A359072 15,15,5,5,5,5,10,10,10,5,30,30,30,30,15,15,15,15,5,5
%N A359072 Denominators of the partial sums of the reciprocals of the maximal exponent in prime factorization of the positive integers (A051903).
%H A359072 Amiram Eldar, <a href="/A359072/b359072.txt">Table of n, a(n) for n = 2..10000</a>
%H A359072 Wolfgang Schwarz and Jürgen Spilker, <a href="https://doi.org/10.1515/9783110944648.221">A remark on some special arithmetical functions</a>, in: E. Laurincikas, E. Manstavicius and V. Stakenas (eds.), Analytic and Probabilistic Methods in Number Theory, Proceedings of the Second International Conference in Honour of J. Kubilius, Palanga, Lithuania, 23-27 September 1996, New Trends in Probability and Statistics, Vol. 4, VSP BV & TEV Ltd. (1997), pp. 221-245.
%H A359072 D. Suryanarayana and R. Chandra Rao, <a href="https://doi.org/10.1007/BF01223919">On the maximum and minimum exponents in factoring integers</a>, Archiv der Mathematik, Vol. 28, No. 1 (1977), pp. 261-269.
%H A359072 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A359072 a(n) = denominator(Sum_{k=2..n} 1/A051903(k)).
%t A359072 f[n_] := Max[FactorInteger[n][[;; , 2]]]; f[1] = 0; Denominator[Accumulate[Table[1/f[n], {n, 2, 100}]]]
%Y A359072 Cf. A051903, A129132, A359071 (numerators).
%K A359072 nonn,frac
%O A359072 2,3
%A A359072 _Amiram Eldar_, Dec 15 2022