|
| |
|
|
A005361
|
|
Product of exponents of prime factorization of n.
(Formerly M0063)
|
|
26
| |
|
|
1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 2, 2, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24=2^3*3 and 375 =3*5^3 both have prime signature (3,1).
There was an old comment here that said "a(n) is the number of nilpotents elements in the ring Z/nZ", but this is false - see A003557.
a(n) is the number of square-full divisors of n. a(n) is also the number of divisors d of n such that d and n have the same prime factors, i.e., A007947(d)=A007947(n). [From Laszlo Toth, May 22 2009]
|
|
|
REFERENCES
| J. Knopfmacher, A prime-divisor function, Proc. Amer. Math. Soc., 40 (1973), 373-377. [From Laszlo Toth, May 22 2009]
Problem 5735, Amer. Math. Monthly, 78 (1971), 680-681.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
D. Suryanarayana and R. Sitaramachandra Rao, The number of square-full divisors of an integer, Proc. Amer. Math. Soc., 34 (1972), 79-80. [From Laszlo Toth, May 22 2009]
|
|
|
LINKS
| Daniel Forgues, Table of n, a(n) for n=1..100000
|
|
|
FORMULA
| n = Product (p_j^k_j) -> a(n) = Product (k_j). Dirichlet g.f.: zeta(s)*zeta(2s)*zeta(3s)/zeta(6s).
Multiplicative with a(p^e) = e. - David W. Wilson, Aug 01, 2001.
a(n)=Sum(d dividing n, floor(rad(d)/rad(n)), where rad(n) is A007947 [From Barbarel Tres Mil (barbarel3000(AT)yahoo.es), Nov 06 2009]
For n > 1: a(n) = prod(k=1..A001221(n), A124010(n,k) ). [Reinhard Zumkeller, Aug 27 2011]
|
|
|
MATHEMATICA
| Prepend[ Array[ Times @@ Last[ Transpose[ FactorInteger[ # ] ] ]&, 100, 2 ], 1 ]
|
|
|
PROG
| (PARI) for(n=1, 100, print1(prod(i=1, omega(n), component(component(factor(n), 2), i)), ", "))
(Haskell)
a005361 = product . a124010_row -- Reinhard Zumkeller, Jan 09 2012
|
|
|
CROSSREFS
| Cf. A000005, A052306. a(p^k)=A000027=n. a(A002110)=A000012=1.
Sequence in context: A157754 A072411 A091050 * A008479 A107345 A000688
Adjacent sequences: A005358 A005359 A005360 * A005362 A005363 A005364
|
|
|
KEYWORD
| nonn,easy,nice,mult
|
|
|
AUTHOR
| Jeffrey Shallit, Olivier Gerard (olivier.gerard(AT)gmail.com)
|
| |
|
|
