|
Search: id:A046660
|
|
|
| A046660 |
|
Excess of n = number of primes divisors (with multiplicity) - number of prime divisors (without multiplicity). |
|
+0
16
|
|
| 0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 1, 0, 0, 0, 2, 1, 0, 2, 1, 0, 0, 0, 4, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 0, 3, 1, 1, 0, 1, 0, 2, 0, 2, 0, 0, 0, 1, 0, 0, 1, 5, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 1, 1, 0, 0, 0, 3, 3, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 4, 0, 1, 1, 2, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
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).
a(n) = 0 for square-free n.
A162511(n) = (-1)^a(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 08 2009]
a(n) = the number of divisors of n that are each a composite power of a prime. [From Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Dec 02 2009]
|
|
REFERENCES
|
M. Kac, Statistical Independence in Probability, Analysis and Number Theory, Carus Monograph 12, Math. Assoc. Amer., 1959, see p. 64.
|
|
FORMULA
|
a(n) = Omega(n) - omega(n) = A001222(n) - A001221(n).
Additive with a(p^e) = e - 1.
|
|
CROSSREFS
|
Cf. A001222, A001221. Not the same as A066301.
Sequence in context: A081221 A103840 A066301 this_sequence A108730 A056973 A107782
Adjacent sequences: A046657 A046658 A046659 this_sequence A046661 A046662 A046663
|
|
KEYWORD
|
nonn,easy,nice,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net).
|
|
|
Search completed in 0.002 seconds
|
