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 A104369 #22 Apr 15 2023 14:11:34
%S A104369 2,2,2,2,2,2,4,2,2,4,2,2,4,4,4,16,16,4,2,16,4,4,8,4,2,16,8,8,2,8,16,
%T A104369 32,16,32,16,8,8,16,128,4,32,16,16,4,16,8,16,4,8,128,16,4,16,4,8,4,16,
%U A104369 8,16,32,8,16,16,4,2,4,16,64,16,8,8,16,16,64,64,64,32,8,64,16,32,8,8,32,8,16,8,16,128,64,16,8,16,4,8
%N A104369 Number of divisors of A104365(n) = A104350(n) + 1.
%H A104369 Max Alekseyev, <a href="/A104369/b104369.txt">Table of n, a(n) for n = 1..158</a> (terms 142..151 from Tyler Busby)
%H A104369 Reinhard Zumkeller, <a href="/A104350/a104350.txt">Products of largest prime factors of numbers <= n</a>
%F A104369 a(n) = A000005(A104365(n)).
%t A104369 a[n_] := DivisorSigma[0, 1 + Product[FactorInteger[k][[-1, 1]], {k, 1, n}]]; Array[a, 76] (* _Amiram Eldar_, Feb 12 2020 *)
%Y A104369 Cf. A000005, A064144, A104350, A104361, A104365, A104366, A104367, A104368, A104370, A104371, A104372.
%K A104369 nonn
%O A104369 1,1
%A A104369 _Reinhard Zumkeller_, Mar 06 2005
%E A104369 a(51)-a(76) from _Amiram Eldar_, Feb 12 2020
%E A104369 Terms a(77) onward from _Max Alekseyev_, Oct 03 2022