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 A328879 #6 Oct 29 2019 12:15:31
%S A328879 1,2,3,2,4,6,5,2,3,8,6,6,7,10,12,2,8,6,9,8,15,12,10,6,4,14,3,10,11,24,
%T A328879 12,2,18,16,20,6,13,18,21,8,14,30,15,12,12,20,16,6,5,8,24,14,17,6,24,
%U A328879 10,27,22,18,24,19,24,15,2,28,36,20,16,30,40,21,6,22,26,12
%N A328879 If n = Product (p_j^k_j) then a(n) = Product (pi(p_j) + 1), where pi = A000720.
%C A328879 a(n) is the product of indices of distinct prime factors of n if 1 is considered as a prime (see A008578).
%H A328879 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%e A328879 a(36) = 6 because 36 = 2^2 * 3^2 = prime(1)^2 * prime(2)^2 and (1 + 1) * (2 + 1) = 6.
%t A328879 a[n_] := Times @@ ((PrimePi[#[[1]]] + 1) & /@ FactorInteger[n]); Table[a[n], {n, 1, 75}]
%o A328879 (PARI) a(n)={my(f=factor(n)[,1]); prod(i=1, #f, 1 + primepi(f[i]))} \\ _Andrew Howroyd_, Oct 29 2019
%Y A328879 Cf. A000720, A007947, A008578, A036234, A048250, A064553, A156061.
%K A328879 nonn,mult
%O A328879 1,2
%A A328879 _Ilya Gutkovskiy_, Oct 29 2019