A326297 If n = Product (p_j^k_j) then a(n) = Product ((p_j - 1)^(k_j - 1)).

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 4, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 4, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 6, 2, 4

Offset

1,9

Links

Antti Karttunen, Table of n, a(n) for n = 1..20000

Index entries for sequences computed from exponents in factorization of n.

Index entries for sequences computed from indices in prime factorization.

Formula

a(n) = A003958(n) / abs(A023900(n)) = abs(A325126(n)) / A007947(n).

Dirichlet g.f.: Product_{p prime} (1 + 1/(p^s - p + 1)). - Amiram Eldar, Dec 07 2023

Example

a(98) = a(2 * 7^2) = (2 - 1)^(1 - 1) * (7 - 1)^(2 - 1) = 6.

Mathematica

a[n_] := If[n == 1, 1, Times @@ ((#[[1]] - 1)^(#[[2]] - 1) & /@ FactorInteger[n])]; Table[a[n], {n, 1, 100}]

Prog

(PARI) a(n) = my(f=factor(n)); for (k=1, #f~, f[k, 1]--; f[k, 2]--); factorback(f); \\ Michel Marcus, Mar 03 2020
(Python)
from math import prod
from sympy import factorint
def a(n): return prod((p-1)**(e-1) for p, e in factorint(n).items())
print([a(n) for n in range(1, 101)]) # Michael S. Branicky, Aug 30 2021

Crossrefs

Cf. A003557, A003958, A003959, A007947, A023900, A064478, A064549, A122132 (positions of 1's), A125131, A173557, A325126, A327564.

Sequence in context: A290106 A359433 A349340 * A060128 A330751 A327407

Adjacent sequences: A326294 A326295 A326296 * A326298 A326299 A326300

Keyword

nonn,mult

Author

Ilya Gutkovskiy, Mar 03 2020

Status

approved