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 A062068 #34 Mar 16 2025 11:42:01
%S A062068 1,2,3,2,4,6,4,4,2,6,6,6,4,8,8,2,6,4,6,8,6,9,8,12,2,8,8,8,8,12,6,6,10,
%T A062068 8,10,4,4,12,8,12,8,12,6,12,8,12,10,6,4,4,12,6,8,16,12,16,10,12,12,16,
%U A062068 4,12,8,2,12,15,6,12,12,15,12,8,4,8,6,12,12,16,10,8,3,12,12,12,12,12
%N A062068 a(n) = d(sigma(n)), where d(k) is the number of divisors function (A000005) and sigma(k) is the sum of divisor function (A000203).
%H A062068 Amiram Eldar, <a href="/A062068/b062068.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harry J. Smith)
%F A062068 a(n) = A000005(A000203(n)) = A062069(n) + A076360(n). - _Amiram Eldar_, Mar 16 2025
%e A062068 a(5) = d(sigma(5)) = d(6) = 4.
%t A062068 Table[DivisorSigma[0, DivisorSigma[1, n]], {n, 1, 80}] (* _Carl Najafi_, Aug 16 2011 *)
%o A062068 (PARI) for(n=1,120,print(numdiv(sigma(n))))
%o A062068 (PARI) { for (n=1, 1000, write("b062068.txt", n, " ", numdiv(sigma(n))) ) } \\ _Harry J. Smith_, Jul 31 2009
%Y A062068 Cf. A000005, A000203, A062068, A062069.
%K A062068 nonn,easy
%O A062068 1,2
%A A062068 _Amarnath Murthy_, Jun 13 2001
%E A062068 Corrected and extended by _Jason Earls_, Jun 16 2001