|
Search: id:A136177
|
|
|
| A136177 |
|
Number of exponents in the prime-factorization of n that are coprime to n. |
|
+0
2
|
|
| 0, 1, 1, 0, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 0, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 0, 1, 1, 3, 1, 1, 2, 2, 2, 0, 1, 2, 2, 2, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 0, 2, 3, 1, 1, 2, 3, 1, 0, 1, 2, 2, 1, 2, 3, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 0, 1, 3, 1, 2, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
8000 = 2^6 * 5^3. 6 is not coprime to 8000, but 3 is. So a(8000) = 1.
|
|
MATHEMATICA
|
Table[Length[Select[Table[FactorInteger[n][[i, 2]], {i, 1, Length[FactorInteger[n]]}], GCD[ #, n] == 1 &]], {n, 2, 90}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 21 2007
|
|
PROGRAM
|
(PARI) A136177(n)={local(t); sum(j=1, #t=factor(n)[, 2]~, gcd(n, t[j])==1)} \\ - M. F. Hasler, Dec 21 2007
|
|
CROSSREFS
|
Cf. A136176.
Adjacent sequences: A136174 A136175 A136176 this_sequence A136178 A136179 A136180
Sequence in context: A050330 A076398 A086257 this_sequence A066922 A033183 A090677
|
|
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
|
