Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064675
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064675 Numbers n such that sopfr(n)=sopf(n+1), where sopf(n)=A008472 and sopfr(n)=A001414. +0
1
5, 27, 77, 714, 836, 948, 1449, 4185, 4624, 5405, 5560, 8476, 8855, 10175, 16932, 17080, 18655, 20450, 20600, 21183, 26642, 28809, 31524, 35631, 37828, 37881, 40081, 47544, 48203, 49240, 52155, 52554, 53192, 63344, 63426, 63665, 79118 (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 (sopfr(m)==sopf(m + 1), write("b064675.txt", n++, " ", m); if (n==500, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 21 2009]

CROSSREFS

Sequence in context: A121876 A137116 A137117 this_sequence A135713 A085740 A129868

Adjacent sequences: A064672 A064673 A064674 this_sequence A064676 A064677 A064678

KEYWORD

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research