Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064010 Numbers n such that sopf(n) = d(n) where d(n) = A001223(n) and sopf(n) = A008472(n). +0
1
2, 64, 135, 154, 168, 256, 350, 512, 539, 1029, 1350, 1875, 2106, 2268, 2646, 2673, 2736, 2976, 4375, 6000, 6076, 6517, 6880, 7680, 9680, 10092, 10584, 14000, 14406, 14580, 14976, 17500, 18522, 20412, 26000, 26068, 26112, 26620, 27216, 28812 (list; graph; listen)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,150

PROGRAM

(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)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 05 2009]

CROSSREFS

Cf. A001223, A008472.

Sequence in context: A024238 A109667 A004853 this_sequence A120829 A120121 A047707

Adjacent sequences: A064007 A064008 A064009 this_sequence A064011 A064012 A064013

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 07 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research