A050414 -id:A050414 - cp's OEIS frontend

A096502 a(n) = k is the smallest exponent k such that 2^k - (2n+1) is a prime number, or 0 if no such k exists.

2, 3, 3, 39, 4, 4, 4, 5, 6, 5, 5, 6, 5, 5, 5, 7, 6, 6, 11, 7, 6, 29, 6, 6, 7, 6, 6, 7, 6, 6, 6, 8, 8, 7, 7, 10, 9, 7, 8, 9, 7, 8, 7, 7, 8, 7, 8, 10, 7, 7, 26, 9, 7, 8, 7, 7, 10, 7, 7, 8, 7, 7, 7, 47, 8, 14, 9, 11, 10, 9, 10, 8, 9, 8, 8, 31, 8, 8, 15, 8, 10, 9

Offset: 0

Labos Elemer, Jul 09 2004

As D. W. Wilson observes, this is similar to the Riesel/Sierpinski problem and there is e.g. no prime of the form 2^k - 777149, which is divisible by 3,5,7,13,19,37 or 73 if k is in 1+2Z, 2+4Z, 4+12Z, 8+12Z, 12+36Z, 0+36Z resp. 24+36Z. Already for n=935 it is difficult to find a solution. Is this linked to the fact that 2n+1=1871 is member of a prime quadruple (A007530) and quintuple (A022007)? - M. F. Hasler, Apr 07 2008

			a(0)=A000043(1)=2, a(1)=A050414(1)=3, a(2)=A059608(1)=3, a(3)=A059609(1)=39.
For n=110 and n=111 even these smallest exponents are rather large: a(110)=714, a(111)=261 which mean that 2^714-221 and 2^261-223 are the least corresponding prime numbers.

T. D. Noe, Table of n, a(n) for n = 0..934
F. Firoozbakht, M. F. Hasler, Variations on Euclid's formula for Perfect Numbers, JIS 13 (2010) #10.3.1.

Cf. A000043, A007530, A022007, A050414, A059608, A059609.

Table[k = 1; While[2^k < n || ! PrimeQ[2^k - n], k++]; k, {n, 1, 1869, 2}] (* T. D. Noe, Mar 18 2013 *)

A096502(n,k)={ k || k=log(n)\log(2)+1; n=2*n+1; while( !ispseudoprime(2^k++-n),);k } /* will take a long time for n=935... */ - M. F. Hasler, Apr 07 2008

A096820 Numbers k such that 2^k - 21 is prime.

Original entry on oeis.org

5, 6, 7, 9, 11, 13, 14, 21, 23, 41, 46, 89, 110, 389, 413, 489, 869, 1589, 1713, 2831, 10843, 11257, 16949, 24513, 39621, 43349, 62941, 96094, 139237, 145289, 264683, 396790, 420694, 439931, 659589, 783893, 840203, 944561

Offset: 1

Labos Elemer, Jul 13 2004

Similar to A057202 (which allows negative primes): this sequence is obtained by dropping the first four terms of A057202. - Joerg Arndt, Oct 05 2012

			k = 5: 32 - 21 = 11 is prime.
k = 7: 128 - 21 = 107 is prime.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n-21, PRP Top Records.

Cf. A096502.

Cf. Sequences of numbers k such that 2^k - d is prime: A000043 (d=1), A050414 (d=3), A059608 (d=5), A059609 (d=7), A059610 (d=9), A096817 (d=11), A096818 (d=13), A059612 (d=15), A059611 (d=17), A096819 (d=19), this sequence (d=21), A057220 (d=23), A356826 (d=29).

Select[Range[5,20000],PrimeQ[2^#-21]&] (* Vladimir Joseph Stephan Orlovsky, Feb 27 2011 *)

def is_A096820(n):
    t = 2^n-21
    return t > 1 and is_prime(t)
def A096820_list(up_to):
    return [n for n in range(up_to) if is_A096820(n)]
A096820_list(100)  # Peter Luschny, Oct 04 2012

a(23)-a(24) from Max Alekseyev, a(25) from Donovan Johnson, a(26)-a(28) from Henri Lifchitz, a(29)-a(30) from Lelio R Paula, added by Max Alekseyev, Feb 10 2012
a(31)-a(32) from Lelio R Paula, added by Max Alekseyev, Oct 24 2013
a(33)-a(34) found by Lelio R Paula, a(35)-a(38) found by Stefano Morozzi, added by Elmo R. Oliveira, Nov 24 2023

A059611 Numbers k such that 2^k - 17 is prime.

Original entry on oeis.org

6, 8, 12, 16, 18, 20, 22, 24, 32, 36, 42, 44, 96, 104, 152, 174, 198, 336, 414, 444, 468, 488, 664, 808, 848, 3632, 4062, 5586, 5904, 6348, 8628, 9224, 9916, 13136, 15966, 17120, 17568, 17652, 20560, 31572, 33644, 104098, 115842, 130572, 164110, 189414, 205110, 406758

Offset: 1

Andrey V. Kulsha, Feb 05 2001

nonn

All terms are even since for odd k, 2^k - 17 is divisible by 3.

			444 is present because 2^444 - 17 is prime.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n-17, PRP Top Records.

Cf. A096502.

Cf. Sequences of numbers k such that 2^k - d is prime: A000043 (d=1), A050414 (d=3), A059608 (d=5), A059609 (d=7), A059610 (d=9), A096817 (d=11), A096818 (d=13), A059612 (d=15), this sequence (d=17), A096819 (d=19), A096820 (d=21), A057220 (d=23), A356826 (d=29).

Select[Range[5,20000],PrimeQ[2^#-17]&] (* Vladimir Joseph Stephan Orlovsky, Feb 27 2011 *)

is(n)=isprime(2^n-17) \\ Charles R Greathouse IV, Feb 17 2017

a(34)-a(40) from Max Alekseyev, a(41) from Paul Underwood, a(42)-a(44) from Gary Barnes, a(45)-a(47) from Lelio R Paula, added by Max Alekseyev, Feb 09 2012

a(48) by Lelio R. Paula, added by Robert Price, Dec 06 2013

A096817 Numbers k such that 2^k - 11 is prime.

Original entry on oeis.org

4, 6, 10, 18, 42, 78, 94, 114, 190, 322, 546, 3894, 10318, 11650, 12474, 20994, 61810, 103882, 296010, 636930, 653638, 926766

Offset: 1

Labos Elemer, Jul 13 2004

All terms are even since for odd k, 2^k - 11 is divisible by 3.

			k = 6: 64 - 11 = 53 is prime.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n-11, PRP Top Records.

Cf. A096502.

Cf. Sequences of numbers k such that 2^k - d is prime: A000043 (d=1), A050414 (d=3), A059608 (d=5), A059609 (d=7), A059610 (d=9), this sequence (d=11), A096818 (d=13), A059612 (d=15), A059611 (d=17), A096819 (d=19), A096820 (d=21), A057220 (d=23), A356826 (d=29).

Select[Range[4,20000],PrimeQ[2^#-11]&] (* Vladimir Joseph Stephan Orlovsky, Feb 26 2011*)

a(13)-a(16) from Max Alekseyev, a(17)-a(18) from Henri Lifchitz, added by Max Alekseyev, Feb 09 2012
a(19) from Lelio R Paula, added by Max Alekseyev, Oct 24 2013
a(20)-a(22) from Stefano Morozzi, added by Elmo R. Oliveira, Nov 16 2023

A096819 Numbers k such that 2^k - 19 is prime.

Original entry on oeis.org

5, 7, 11, 15, 19, 21, 31, 39, 67, 69, 85, 157, 171, 191, 255, 291, 379, 3669, 4551, 9531, 13119, 14211, 20647, 233965, 337267, 534429, 535415, 816039, 991715

Offset: 1

Labos Elemer, Jul 13 2004

All terms are odd since for even k, 2^k - 19 is divisible by 3.

a(26) > 5*10^5. - Tyler NeSmith, Apr 16 2022

			2^7 - 19 = 128 - 19 = 109, a prime, so 7 is a term of the sequence.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n-19, PRP Top Records.

Cf. A096502.

Cf. Sequences of numbers k such that 2^k - d is prime: A000043 (d=1), A050414 (d=3), A059608 (d=5), A059609 (d=7), A059610 (d=9), A096817 (d=11), A096818 (d=13), A059612 (d=15), A059611 (d=17), this sequence (d=19), A096820 (d=21), A057220 (d=23), A356826 (d=29).

Select[Range[5,20000],PrimeQ[2^#-19]&] (* Vladimir Joseph Stephan Orlovsky, Feb 27 2011*)

a(22)-a(23) from Max Alekseyev, Feb 10 2012
a(24)-a(25) from Lelio R Paula, added by Max Alekseyev, Oct 24 2013
a(26)-a(29) found by Stefano Morozzi, added by Alois P. Heinz, Aug 29 2022

A057220 Numbers k such that 2^k - 23 is prime.

Original entry on oeis.org

2, 4, 6, 8, 12, 14, 18, 36, 68, 152, 212, 324, 1434, 1592, 1668, 3338, 7908, 9662, 27968, 28116, 33974, 41774, 66804, 144518, 162954, 241032, 366218, 676592, 991968

Offset: 1

Robert G. Wilson v, Sep 16 2000

Note that for the values 2 and 4 the primes are negative.
a(22) > 41358. - Jinyuan Wang, Jan 20 2020
All terms are even. - Elmo R. Oliveira, Nov 24 2023

			k = 6: 2^6 - 23 = 41 is prime.
k = 8: 2^8 - 23 = 233 is prime.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n-23, PRP Top Records.

Cf. A096502.

Cf. Sequences of numbers k such that 2^k - d is prime: A000043 (d=1), A050414 (d=3), A059608 (d=5), A059609 (d=7), A059610 (d=9), A096817 (d=11), A096818 (d=13), A059612 (d=15), A059611 (d=17), A096819 (d=19), A096820 (d=21), this sequence (d=23), A356826 (d=29).

Do[ If[ PrimeQ[ 2^n - 23 ], Print[ n ] ], { n, 1, 15000} ]

is(n)=ispseudoprime(2^n-23) \\ Charles R Greathouse IV, Jun 13 2017

a(19)-a(21) from Jinyuan Wang, Jan 20 2020

a(22)-a(23) found by Henri Lifchitz, a(24)-a(27) found by Lelio R Paula, a(28)-a(29) found by Stefano Morozzi, added by Elmo R. Oliveira, Nov 24 2023

A356826 Numbers k such that 2^k - 29 is prime.

Original entry on oeis.org

5, 8, 104, 212, 79316, 102272, 225536, 340688

Offset: 1

Craig J. Beisel, Aug 29 2022

A particularly low-density pseudo-Mersenne sequence. I have verified that there are no additional terms for k < 5*10^4. For k = a(5), a(6), a(7), and a(8), 2^k - 29 is a probable prime (see link).
The terms a(5)-a(8) were discovered by Henri Lifchitz (see link). - Elmo R. Oliveira, Nov 29 2023
Empirically: except for 5, all terms are even. - Elmo R. Oliveira, Nov 29 2023

			5 is a term because 2^5 - 29 = 3 is prime.
8 is a term because 2^8 - 29 = 227 is prime.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n-29, PRP Top Records.

Cf. A096502.

Cf. Sequences of numbers k such that 2^k - d is prime: A000043 (d=1), A050414 (d=3), A059608 (d=5), A059609 (d=7), A059610 (d=9), A096817 (d=11), A096818 (d=13), A059612 (d=15), A059611 (d=17), A096819 (d=19), A096820 (d=21), A057220 (d=23), this sequence (d=29).

for(n=2, 1000, if(isprime(2^n-29), print1(n, ", ")))

A059266 Numbers k such that 4^k - 3 is prime.

Original entry on oeis.org

2, 3, 5, 6, 7, 10, 11, 12, 47, 58, 61, 75, 87, 133, 168, 226, 347, 425, 868, 1977, 2815, 3378, 4385, 5286, 7057, 7200, 8230, 8340, 13175, 17226, 18276, 25237, 33211, 58463, 59662, 94555, 120502, 177473, 197017, 351097, 375370, 563190, 673872, 881002, 1043375

Offset: 1

G. L. Honaker, Jr., Jan 23 2001

nonn

The halved even terms of A050414. - R. J. Mathar, Feb 26 2008

			For k = 10, 4^10 - 3 = 1048573 is prime.

Daniel Minoli, Voice over MPLS, McGraw-Hill, New York, NY, 2002, ISBN 0-07-140615-8 (p.114-134) [From Daniel Minoli (daniel.minoli(AT)ses.com), Aug 26 2009]
Daniel Minoli, New Results For Hyperperfect Numbers, Abstracts American Math. Soc., October 1980, Issue 6, Vol. 1, pp. 561. [From Daniel Minoli (daniel.minoli(AT)ses.com), Aug 26 2009]

Daniel Minoli, W. Nakamine, Mersenne Numbers Rooted On 3 For Number Theoretic Transforms, 1980 IEEE International Conf. on Acoust., Speech and Signal Processing. [From Daniel Minoli (daniel.minoli(AT)ses.com), Aug 26 2009]

Cf. A050414, A217348 (similar sequence).

Select[Range[10000], PrimeQ[4^# - 3] &] (* G. C. Greubel, Jan 03 2016 *)

is(n)=isprime(4^n-3) \\ Charles R Greathouse IV, Feb 17 2017

425 and 868 found by Andrey V. Kulsha, Feb 02 2001
More terms (not certified prime) from Jason Earls, Jan 04 2002
9 more terms from Ryan Propper, Feb 27 2008
a(32)-a(41) derived from A050414 by Robert Price, Apr 26 2014
a(42)-a(45) derived from A050414 by Elmo R. Oliveira, Nov 28 2023

A181703 Numbers of the form 2^(t-1)*(2^t-3), where 2^t-3 is prime.

Original entry on oeis.org

20, 104, 464, 1952, 130304, 522752, 8382464, 134193152, 549754241024, 8796086730752, 140737463189504, 144115187270549504, 196159429230833773869868419445529014560349481041922097152, 3450873173395281893717377931138512601610429881249330192849350210617344

Offset: 1

Vladimir Shevelev, Nov 06 2010

nonn

This is a subsequence of A181595. [Proof: sigma(m) = (2^t-1)*(2^t-2) leads to an abundance of m which is 2.]
Numbers m such that the sum of the even divisors of m equals the square of the odd divisors of m.
Proof: let s0 the sum of the even divisors and s1 the sum of the odd divisors.
s1 = 2^t-2 because 2^t-3 is prime.
s0 = 2 + 4 + 8 + ... + 2^(t-1) + (2^t - 3)(2 + 4 + 8 + ... + 2^(t-1)) = (2^t - 2)^2 => s0 = s1^2. - Michel Lagneau, Apr 17 2013

Eric Chen, Table of n, a(n) for n = 1..28
Christian Kassel and Christophe Reutenauer, Pairs of intertwined integer sequences, arXiv:2507.15780 [math.NT], 2025. See p. 12.

Cf. A181595, A181701, A000396, A050414, A050415.

with(numtheory):for n from 1 to 600000 do:x:=divisors(n):n0:=nops(x):s0:=0:s1:=0:for k from 1 to n0 do:if irem(x[k],2)=0 then s0:=s0+ x[k]:else s1:=s1+ x[k]:fi:od:if s0=s1^2 then print(n):else fi:od: # Michel Lagneau, Apr 17 2013

for(k=1, 200, if(ispseudoprime(2^k-3), print1(2^(k-1)*(2^k-3), ", "))) \\ Eric Chen, Jun 13 2018

a(n) = 2^(A050414(n)-1) * (2^A050414(n) - 3). - Max Alekseyev, Jul 31 2025

Edited and extended by D. S. McNeil, Nov 18 2010

Definition simplified by R. J. Mathar, Nov 18 2010

A234285 Positive odd numbers n such that sigma(m) - 2m is never equal to n, where sigma(.) is the sum of divisors function A000203. Conjectural.

Original entry on oeis.org

1, 5, 9, 11, 13, 15, 21, 23, 25, 27, 29, 33, 35, 37, 43, 45

Offset: 1

N. J. A. Sloane, Dec 28 2013

The terms shown here are conjectural, based on a search up to 10^20 made by Davis et al. (2013).
Comments from Farideh Firoozbakht, Jan 12 2014: (Start)
1. Mersenne primes are not in this sequence. Because if M=2^p-1 is prime then M=sigma(m)-2m, where m=2^(p-1)*(2^p-1)^2=(1/2)*(M+1)*M^2 (please see Proposition 2.1 of Firoozbakht-Hasler, 2010).
2. If M = 2^p - 1 is a Mersenne prime then M^2 + 3M + 1 = 4^p + 2^p - 1 is not in the sequence. Because M^2 + 3M + 1 = sigma(m) - 2m where m = M^3 + M^2 = 2^p(2^p-1)^2 (please see Proposition 2.5, op. cit.).
Examples:
p = 2, M = 3, 4^p + 2^p - 1 = 19, m = M^3 + M^2 = 2^p(2^p-1)^2 = 36; sigma(m) - 2m = 19
p = 3, M = 7, 4^p + 2^p - 1 = 71, m = M^3 + M^2 = 2^p(2^p-1)^2 = 392; sigma(m) - 2m = 71
3. Note that if r is an even number and if for a number k p = 2^k - r - 1 is an odd prime then r = sigma(m) - 2m where m = 2^(k-1)*p. Namely r is not in the sequence (see Theorem 1.1, op. cit.).
It seems that for each even number r, there exists at least one odd prime of the form 2^k - r - 1. This means there is no even term in the sequence.
Moreover I conjecture that, for each even number r, there exist infinitely many primes p of the form 2^k - r - 1, or equivalently, I conjecture that: For each odd number s, there exists infinitely many primes p of the form 2^k - s.
Special cases:
(i): s = 1, there exist infinitely many Mersenne primes.
(ii): s = -1, there exist infinitely many Fermat primes.
(iii): s = 3, sequence A050414 is infinite.
(iv): s = -3, sequence A057732 is infinite.
(v): s = -5, sequence A059242 is infinite.
and so on. (End)
Cohen (1983) showed that 203^2 is not a term since sigma(m) - 2*m = 203^2 has a solution m = 742^2. - Max Alekseyev, Aug 29 2025

Graeme L. Cohen, Generalised quasiperfect numbers, Ph.D. Dissertation, University of New South Wales, Sydney, 1982. Abstract in Bull. Australian Math. Soc., 27 (1983), 153-155.
Nichole Davis, Dominic Klyve and Nicole Kraght, On the difference between an integer and the sum of its proper divisors, Involve, Vol. 6 (2013), No. 4, 493-504; DOI: 10.2140/involve.2013.6.493
Farideh Firoozbakht and M. F. Hasler, Variations on Euclid's formula for perfect numbers, Journal of Integer Sequences 13 (2010), 18 pp. #10.3.1.

Cf. A000203, A033879 (2n - sigma(n)).

For negative values of n see A234286.

Edited by Max Alekseyev, Aug 29 2025

cp's OEIS Frontend

A096502 a(n) = k is the smallest exponent k such that 2^k - (2n+1) is a prime number, or 0 if no such k exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A096820 Numbers k such that 2^k - 21 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Sage

Extensions

A059611 Numbers k such that 2^k - 17 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A096817 Numbers k such that 2^k - 11 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A096819 Numbers k such that 2^k - 19 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A057220 Numbers k such that 2^k - 23 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A356826 Numbers k such that 2^k - 29 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI