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!)
A248792 Numbers n such that sigma(n) - 1 is a prime p. 7

%I #24 Sep 08 2022 08:46:10

%S 2,3,5,6,7,10,11,13,14,15,17,19,20,21,23,24,26,29,30,31,33,34,35,37,

%T 38,40,41,43,44,46,47,51,52,53,55,57,58,59,60,61,63,65,67,71,73,74,76,

%U 78,79,83,84,85,86,88,89,90,92,93,96,97,101,103,105,107,109

%N Numbers n such that sigma(n) - 1 is a prime p.

%C Union of primes (A000040) and terms of A066073 (composites).

%C Numbers n such that A039653(n) is prime.

%C Corresponding values of primes p are in A248793.

%H Michael De Vlieger, <a href="/A248792/b248792.txt">Table of n, a(n) for n = 1..10000</a>

%H OEIS Wiki, <a href="https://oeis.org/wiki/Cyclotomic Polynomials at x=n, n! and sigma(n)">Cyclotomic Polynomials at x=n, n! and sigma(n)</a>

%e 6 is in sequence because sigma(6) - 1 = 12 - 1 = 11 (prime).

%p with(numtheory): A248792:=n->`if`(isprime(sigma(n)-1), n, NULL): seq(A248792(n), n=1..200); # _Wesley Ivan Hurt_, Jul 09 2015

%t Select[Range[110], PrimeQ[DivisorSigma[1, #] - 1] &] (* _Vincenzo Librandi_, Nov 02 2014 *)

%o (Magma) [n: n in[1..1000] | IsPrime(SumOfDivisors(n) - 1)]

%o (PARI) for(n=1,10^3,if(isprime(sigma(n)-1),print1(n,", "))) \\ _Derek Orr_, Nov 01 2014

%Y Cf. A000203 (sum of divisors), A000040 (primes).

%Y Cf. A039653 (sigma(n)-1), A066073 (subsequence of composites), A248793.

%Y Cf. A065512 (numbers n such that sigma(n) + 1 is prime).

%K nonn,easy

%O 1,1

%A _Jaroslav Krizek_, Nov 01 2014

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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)