The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341041 If n = Product (p_j^k_j) then a(n) = 1 + Product (a(pi(p_j))), where pi = A000720, with a(1) = 1. 0
1, 2, 3, 2, 4, 3, 3, 2, 3, 4, 5, 3, 4, 3, 7, 2, 4, 3, 3, 4, 5, 5, 4, 3, 4, 4, 3, 3, 5, 7, 6, 2, 9, 4, 7, 3, 4, 3, 7, 4, 5, 5, 4, 5, 7, 4, 8, 3, 3, 4, 7, 4, 3, 3, 13, 3, 5, 5, 5, 7, 4, 6, 5, 2, 10, 9, 4, 4, 7, 7, 5, 3, 6, 4, 7, 3, 9, 7, 6, 4, 3, 5, 5, 5, 10, 4, 9, 5, 4, 7, 7, 4, 11, 8, 7, 3, 5, 3, 9, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = a(prime(n)^k) - 1 for k > 0.
a(2*n) = a(n) for n > 1.
EXAMPLE
a(45) = a(3^2 * 5) = a(prime(2)^2 * prime(3)) = 1 + a(2) * a(3) = 1 + 2 * 3 = 7.
MAPLE
a:= n-> `if`(n=1, 1, 1+mul(a(numtheory[pi](i[1])), i=ifactors(n)[2])):
seq(a(n), n=1..100); # Alois P. Heinz, Feb 03 2021
MATHEMATICA
a[1] = 1; a[n_] := a[n] = 1 + Times @@ (a[PrimePi[#[[1]]]] & /@ FactorInteger[n]); Table[a[n], {n, 100}]
CROSSREFS
Sequence in context: A358667 A358552 A317713 * A361660 A318046 A246348
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 03 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 19:11 EDT 2024. Contains 372882 sequences. (Running on oeis4.)