OFFSET
1,1
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..2000 (first 150 terms from Harry J. Smith)
PROG
(PARI) sopf(n, s, fac, i)=fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]); return(s);
d(n) = prime(n+1)-prime(n);
j=[]; for(n=1, 50000, if(sopf(n)==d(n), j=concat(j, n))); j
(PARI) sopf(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) }
d(n)= { prime(n + 1) - prime(n) }
{ default(primelimit, 13500000); n=0; for (m=1, 10^9, if (sopf(m)==d(m), write("b064010.txt", n++, " ", m); if (n==150, break)) ) } \\ Harry J. Smith, Sep 05 2009
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Sep 07 2001
STATUS
approved