|
Search: id:A064445
|
|
|
| A064445 |
|
sopf(n)-pi(n) = tau(n). |
|
+0
1
|
|
| 5, 39, 172, 305, 1182, 1194, 2947, 8936, 24363, 24399, 24417, 64730, 174977, 482028
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
sopf(n) = A008472(n) = sum of distinct prime factors of n.
|
|
PROGRAM
|
(PARI) sopf(n, fac) = fac=factor(n); sum(i=1, matsize(fac)[1], fac[i, 1]); pi(x, c) = forprime(p=2, x, c++); c for(n=1, 10^6, if(sopf(n)-pi(n)==numdiv(n), print(n)))
|
|
CROSSREFS
|
Cf. A000005, A000720, A008472.
Adjacent sequences: A064442 A064443 A064444 this_sequence A064446 A064447 A064448
Sequence in context: A069471 A110467 A095230 this_sequence A123614 A075135 A053573
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Oct 02 2001
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 05 2001. No further term < 800000.
|
|
|
Search completed in 0.002 seconds
|
