login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064112 Numbers n such that sopf(n) = 2*sopf(n+1), where sopf(n)=A008472. 1
99, 155, 689, 1106, 1517, 1524, 3014, 3403, 3479, 5809, 6478, 6723, 8606, 9143, 9454, 9797, 10126, 11771, 12283, 12382, 13112, 13969, 14150, 17422, 19303, 22184, 24856, 27466, 28119, 28529, 35927, 36464, 37512, 41904, 44505, 45016, 45506 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

sopf(689)=66, 2*sopf(690)=66.

PROG

(PARI) sopf(n, s, fac, i) = fac=factor(n); for(i=1, matsize(fac)[1], s=s+fac[i, 1]); return(s); j=[]; for(n=1, 50000, if(sopf(n)==2*sopf(n+1), 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) } { n=0; sm=sopf(1); for (m=1, 10^9, sp=sopf(m + 1); if (sm==2*sp, write("b064112.txt", n++, " ", m); if (n==600, break)); sm=sp ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 07 2009]

CROSSREFS

Sequence in context: A039446 A165603 A095420 * A185498 A126230 A055164

Adjacent sequences:  A064109 A064110 A064111 * A064113 A064114 A064115

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:59 EST 2012. Contains 205694 sequences.