Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064112
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064112 Numbers n such that sopf(n) = 2*sopf(n+1), where sopf(n)=A008472. +0
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; listen)
OFFSET

1,1

EXAMPLE

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

PROGRAM

(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

CROSSREFS

Sequence in context: A045298 A039446 A095420 this_sequence A126230 A055164 A075815

Adjacent sequences: A064109 A064110 A064111 this_sequence A064113 A064114 A064115

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 08 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research