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 A146288 #17 Aug 05 2024 08:31:55
%S A146288 1,2,3,4,4,6,5,8,8,6,9,10,12,7,12,12,16,8,15,18,14,16,16,20,9,18,24,
%T A146288 16,24,20,24,10,21,30,18,32,24,27,28,11,32,24,36,25,36,20,40,28,36,32,
%U A146288 12,40,27,32,48,30,42,22,48,32,45,36,13,48,30,48,60,35,48,48,24,54,50,56
%N A146288 Number of divisors of the n-th prime signature number (A025487(n)).
%H A146288 Reinhard Zumkeller, <a href="/A146288/b146288.txt">Table of n, a(n) for n = 1..10000</a>
%F A146288 a(n) = A000005(A025487(n)).
%e A146288 a(4) = 4 because 4 positive integers divide evenly into A025487(4) = 6: 1, 2, 3 and 6.
%t A146288 s = {1}; Do[If[GreaterEqual @@ (f = FactorInteger[n])[[;; , 2]] && PrimePi[f[[-1, 1]]] == Length[f], AppendTo[s, DivisorSigma[0, n]]], {n, 2, 10000}]; s (* _Amiram Eldar_, Aug 05 2024 *)
%o A146288 (Haskell)
%o A146288 a146288 = a000005 . a025487 -- _Reinhard Zumkeller_, Sep 17 2014
%Y A146288 a(n) = sum of the n-th row of A146290, A146292.
%Y A146288 A rearrangement of A080444.
%Y A146288 Cf. A000005 (number of divisors), A025487.
%K A146288 nonn
%O A146288 1,2
%A A146288 _Matthew Vandermast_, Nov 11 2008