login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A328879 If n = Product (p_j^k_j) then a(n) = Product (pi(p_j) + 1), where pi = A000720. 2
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, 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, 10, 27, 22, 18, 24, 19, 24, 15, 2, 28, 36, 20, 16, 30, 40, 21, 6, 22, 26, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) is the product of indices of distinct prime factors of n if 1 is considered as a prime (see A008578).

LINKS

Table of n, a(n) for n=1..75.

Index entries for sequences computed from indices in prime factorization

EXAMPLE

a(36) = 6 because 36 = 2^2 * 3^2 = prime(1)^2 * prime(2)^2 and (1 + 1) * (2 + 1) = 6.

MATHEMATICA

a[n_] := Times @@ ((PrimePi[#[[1]]] + 1) & /@ FactorInteger[n]); Table[a[n], {n, 1, 75}]

PROG

(PARI) a(n)={my(f=factor(n)[, 1]); prod(i=1, #f, 1 + primepi(f[i]))} \\ Andrew Howroyd, Oct 29 2019

CROSSREFS

Cf. A000720, A007947, A008578, A036234, A048250, A064553, A156061.

Sequence in context: A285712 A062068 A328219 * A130542 A128502 A244306

Adjacent sequences:  A328876 A328877 A328878 * A328880 A328881 A328882

KEYWORD

nonn,mult

AUTHOR

Ilya Gutkovskiy, Oct 29 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 8 01:41 EST 2021. Contains 341934 sequences. (Running on oeis4.)