|
Search: id:A064159
|
|
|
| A064159 |
|
Numbers n such that g(n) + sopf(n) = n, where g(n)= number of nonprimes <=n [A062298] and sopf(n) = sum of primes dividing n (with repetition) [A001414]. |
|
+0
1
|
|
| 1, 24, 27, 30, 55, 65, 95, 145, 155, 185, 205, 822, 894, 2779, 2863, 8104
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
PROGRAM
|
(PARI) g(n) = s=0; for(x=1, n, if(isprime(x), n++, s++)); s sopf(n, s, fac, i) = fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]*fac[i, 2]); return(s); for(n=1, 10^6, if(g(n)+sopf(n)==n, print(n)))
|
|
CROSSREFS
|
Adjacent sequences: A064156 A064157 A064158 this_sequence A064160 A064161 A064162
Sequence in context: A058627 A116203 A071833 this_sequence A141632 A141634 A067193
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Sep 15 2001
|
|
|
Search completed in 0.002 seconds
|
