The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063785 Numbers n such that sigma(n) = 2n + omega(n), where omega(n) is the number of distinct prime divisors of n. 0
20, 104, 464, 1952, 4030, 5830, 130304, 522752, 1848964, 8382464, 134193152 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
It is easily proved that if 2^m-3 is prime then 2^(m-1)*(2^m-3) is in the sequence. - Farideh Firoozbakht, Feb 12 2008
LINKS
PROG
(PARI) for(n=1, 10^8, if(sigma(n)==2*n+omega(n), print(n)))
CROSSREFS
Cf. A045768.
Sequence in context: A189950 A045768 A088831 * A181703 A334419 A187756
KEYWORD
nonn,more
AUTHOR
Jason Earls, Aug 17 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 00:30 EDT 2024. Contains 373110 sequences. (Running on oeis4.)