|
Search: id:A064444
|
|
| |
|
| 1, 4, 12, 28, 30, 52, 55, 65, 68, 76, 95, 145, 155, 185, 205, 822, 894, 2779, 2863, 8392, 23481, 24093, 24237, 64270, 174691, 174779
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
sopf(n) = A008472(n) = sum of distinct prime factors of n.
|
|
PROGRAM
|
(PARI) pi(x, c=0) = forprime(p=2, x, c++); c sopf(n, fac) = fac=factor(n); sum(i=1, matsize(fac)[1], fac[i, 1]) j=[]; for(n=1, 25000, if(pi(n)==sopf(n), j=concat(j, n))); j
|
|
CROSSREFS
|
Cf. A008472, A000720.
Sequence in context: A007009 A104384 A013697 this_sequence A072182 A009906 A109629
Adjacent sequences: A064441 A064442 A064443 this_sequence A064445 A064446 A064447
|
|
KEYWORD
|
easy,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 terms < 800000.
|
|
|
Search completed in 0.002 seconds
|
