|
Search: id:A136176
|
|
|
| A136176 |
|
Number of exponents in the prime-factorization of n which divide n. |
|
+0
2
|
|
| 0, 1, 1, 1, 1, 2, 1, 0, 0, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 0, 2, 1, 2, 1, 3, 1, 0, 2, 2, 2, 2, 1, 2, 2, 1, 1, 3, 1, 2, 1, 2, 1, 2, 0, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1, 3, 1, 2, 1, 0, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 1, 2, 2, 3, 1, 2, 0, 2, 1, 3, 2, 2, 2, 1, 1, 3, 2, 2, 2, 2, 2, 1, 1, 2, 1, 2, 1, 3, 1, 1, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
128000 = 2^10 * 5^3. 10 divides 128000, but 3 does not. So a(128000) = 1.
|
|
MATHEMATICA
|
Table[Length[Select[Table[FactorInteger[n][[i, 2]], {i, 1, Length[FactorInteger[n]]}], Mod[n, # ] == 0 &]], {n, 1, 90}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 21 2007
|
|
PROGRAM
|
(PARI) A136176(n)=sum(j=1, #t=factor(n)[, 2]~, !(n%t[j])) \\ - M. F. Hasler, Dec 21 2007
|
|
CROSSREFS
|
Cf. A136177.
Sequence in context: A125070 A125071 A161528 this_sequence A103344 A123484 A008626
Adjacent sequences: A136173 A136174 A136175 this_sequence A136177 A136178 A136179
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Leroy Quet, Dec 19 2007
|
|
EXTENSIONS
|
More terms from M. F. Hasler (Maximilian.Hasler(AT)gmail.com) and Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 21 2007
|
|
|
Search completed in 0.002 seconds
|
