Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064678
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064678 Numbers n such that sopf(n)=sopfr(n+1), where sopf(n)=A008472 and sopfr(n)=A001414. +0
1
5, 15, 77, 99, 104, 153, 369, 492, 539, 714, 1330, 2491, 4191, 5405, 5831, 5959, 6556, 6579, 6723, 8463, 9424, 12221, 12351, 12726, 13419, 14587, 21716, 24432, 24880, 24895, 26642, 30267, 31487, 33019, 35456, 38324, 43215, 43802, 44831, 45524 (list; graph; listen)
OFFSET

1,1

LINKS

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

PROGRAM

(PARI) sopf(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) } sopfr(n)= { local(f, s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]*f[i, 2]); return(s) } { n=0; for (m=1, 10^9, if (sopf(m)==sopfr(m + 1), write("b064678.txt", n++, " ", m); if (n==500, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 22 2009]

CROSSREFS

Sequence in context: A149654 A149655 A032122 this_sequence A088935 A030487 A165470

Adjacent sequences: A064675 A064676 A064677 this_sequence A064679 A064680 A064681

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Oct 10 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 December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research