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!)
A063788 Numbers k such that sigma(k) = 2k + Omega(k), where Omega(n) is the number of prime divisors of n (with repetition). 0

%I #10 Oct 30 2022 07:06:18

%S 18,88,4030,5830,518656,13174976,134094848,2146926592

%N Numbers k such that sigma(k) = 2k + Omega(k), where Omega(n) is the number of prime divisors of n (with repetition).

%C From Donovan Johnson_, Dec 19 2008: (Start)

%C a(9) <= 2251798907715584.

%C a(10) <= 633825300114085990300727115776.

%C a(11) <= 2596148429267411760623818083663872. (End)

%C a(9) > 10^13. - _Giovanni Resta_, Jul 13 2015

%F Numbers k such that A000203(k) = 2k + A001222(k). - _Wesley Ivan Hurt_, Oct 30 2022

%o (PARI) for(n=1,10^8, if(sigma(n)==2*n+bigomega(n),print(n)))

%Y Cf. A000203 (sigma), A001222 (Omega).

%K more,nonn

%O 1,1

%A _Jason Earls_, Aug 16 2001

%E a(7)-a(8) from _Donovan Johnson_, Dec 19 2008

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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)