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!)
A086454 Number of divisors of prime powers: tau(p^e). 1
1, 2, 2, 3, 2, 2, 4, 3, 2, 2, 5, 2, 2, 2, 3, 4, 2, 2, 6, 2, 2, 2, 2, 3, 2, 2, 2, 7, 2, 2, 2, 2, 5, 2, 2, 2, 2, 2, 2, 2, 2, 3, 4, 2, 8, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 9, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Divisor Function.
Eric Weisstein's World of Mathematics, Prime Power.
FORMULA
a(n) = A000005(A000961(n)).
a(n) = e+1 for A000961(n) = p^e.
a(n) = A025474(n) + 1.
MATHEMATICA
f[n_] := Module[{f = FactorInteger[n]}, If[Length[f] == 1, f[[1, 2]] + 1, Nothing]]; f[1] = 1; Array[f, 400] (* Amiram Eldar, Apr 09 2024 *)
CROSSREFS
Sequence in context: A160651 A230296 A278317 * A339492 A069360 A175509
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jul 20 2003
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 21 05:34 EDT 2024. Contains 372728 sequences. (Running on oeis4.)