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!)
A205525 Nonprime numbers k such that gcd(k, sigma(k)) == sigma(k) (mod k). 2

%I #19 Feb 09 2021 02:44:15

%S 1,6,12,18,20,24,28,40,56,88,104,120,180,196,224,234,240,360,368,420,

%T 464,496,540,600,650,672,780,992,1080,1344,1504,1872,1888,1890,1952,

%U 2016,2184,2352,2376,2688,3192,3276,3724,3744,4284,4320,4680,5292,5376,5624

%N Nonprime numbers k such that gcd(k, sigma(k)) == sigma(k) (mod k).

%C Complement of primes (A000040) with respect to A205523.

%e 24 is in the sequence because gcd(24; sigma(24)=60) = (sigma(24)=60) mod 24 = 12.

%t Select[Range[10000], ! PrimeQ[#] && Mod[GCD[#, DivisorSigma[1, #]] - DivisorSigma[1, #], #] == 0 &] (* _T. D. Noe_, Feb 03 2012 *)

%o (PARI) isok(k) = if (!isprime(k), my(s=sigma(k)); Mod(gcd(k, s), k) == Mod(s, k)); \\ _Michel Marcus_, Feb 09 2021

%Y Cf. A000203, A000040, A009194, A054024, A205524, A205523.

%K nonn

%O 1,2

%A _Jaroslav Krizek_, Jan 28 2012

%E Corrected by _T. D. Noe_, Feb 03 2012

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 May 23 14:50 EDT 2024. Contains 372763 sequences. (Running on oeis4.)