A057732 -id:A057732 - cp's OEIS frontend

A057203 Numbers k such that 2^k + 23 is prime.

3, 7, 39, 79, 359, 451, 1031, 1039, 11311, 30227, 47599, 55731, 307099, 351831, 418851

Offset: 1

Robert G. Wilson v, Sep 16 2000

a(16) > 5*10^5. - Robert Price, Sep 06 2015

All terms are odd. - Elmo R. Oliveira, Dec 01 2023

			For k = 39, 2^39 + 23 = 549755813911 is prime.

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

Cf. A094076.

Cf. A019434 (primes 2^k+1), A057732 (2^k+3), A059242 (2^k+5), A057195 (2^k+7), A057196(2^k+9), A102633 (2^k+11), A102634 (2^k+13), A057197 (2^k+15), A057200 (2^k+17), A057221 (2^k+19), A057201 (2^k+21), this sequence (2^k+23).

Do[ If[ PrimeQ[2^n + 23], Print[ n ]], {n, 1, 5000} ]

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

a(9)-a(15) from Robert Price, Sep 06 2015

A081091 Primes of the form 2^i + 2^j + 1, i > j > 0.

Original entry on oeis.org

7, 11, 13, 19, 37, 41, 67, 73, 97, 131, 137, 193, 521, 577, 641, 769, 1033, 1153, 2053, 2081, 2113, 4099, 4129, 8209, 12289, 16417, 18433, 32771, 32801, 32833, 40961, 65539, 133121, 147457, 163841, 262147, 262153, 262657, 270337, 524353, 524801

Offset: 1

Reinhard Zumkeller, Mar 05 2003

This is sequence A070739 without the Fermat primes, A000215. Sequence A081504 lists the i for which there are no primes. - T. D. Noe, Jun 22 2007

Primes in A014311. - Reinhard Zumkeller, May 03 2012

			    7 = 2^2 + 2^1 + 1
   11 = 2^3 + 2^1 + 1
   13 = 2^3 + 2^2 + 1
   19 = 2^4 + 2^1 + 1
   37 = 2^5 + 2^2 + 1
   41 = 2^5 + 2^3 + 1
   67 = 2^6 + 2^1 + 1
   73 = 2^6 + 2^3 + 1
   97 = 2^6 + 2^5 + 1
  131 = 2^7 + 2^1 + 1
  137 = 2^7 + 2^3 + 1
  193 = 2^7 + 2^6 + 1
  521 = 2^9 + 2^3 + 1

T. D. Noe and Robert Israel, Table of n, a(n) for n = 1..7800 (n = 1..1000 from T. D. Noe)
Richard Ehrenborg and N. Bradley Fox, The Descent Set Polynomial Revisited, arXiv:1408.6858 [math.CO], 2014.
Norman B. Fox, Combinatorial Potpourri: Permutations, Products, Posets, and Pfaffians, University of Kentucky, Theses and Dissertations, Mathematics, Paper 25.

Essentially the same as A070739.
Cf. A000040, A000215, A081092, A010051.
Cf. A095077 (primes with four bits set).
A057733 = 2^A057732 + 3 and A039687 = 3*2^A002253 + 1 are subsequences.

a081091 n = a081091_list !! (n-1)
a081091_list = filter ((== 1) . a010051') a014311_list
-- Reinhard Zumkeller, May 03 2012

N:= 20: # to get all terms < 2^N
select(isprime, [seq(seq(2^i+2^j+1,j=1..i-1),i=1..N-1)]); # Robert Israel, May 17 2016

Select[Flatten[Table[2^i + 2^j + 1, {i, 21}, {j, i-1}]], PrimeQ] (* Alonso del Arte, Jan 11 2011 *)

do(mx)=my(v=List(),t); for(i=2,mx,for(j=1,i-1,if(ispseudoprime(t=2^i+2^j+1), listput(v,t)))); Vec(v) \\ Charles R Greathouse IV, Jan 02 2014

is(n)=hammingweight(n)==3 && isprime(n) \\ Charles R Greathouse IV, Aug 28 2017

A81091=[7]; next_A081091(p, i=exponent(p), j=exponent(p-2^i))=!until(isprime(2^i+2^j+1), j++>=i && i++ && j=1)+2^i+2^j
A081091(n)={for(k=#A81091, n-1, A81091=concat(A81091, next_A081091(A81091[k]))); A81091[n]} \\ M. F. Hasler, Mar 03 2023

from itertools import count, islice
from sympy import isprime
from sympy.utilities.iterables import multiset_permutations
def A081091_gen(): # generator of terms
    return filter(isprime,map(lambda s:int('1'+''.join(s)+'1',2),(s for l in count(1) for s in multiset_permutations('0'*(l-1)+'1'))))
A081091_list = list(islice(A081091_gen(),30)) # Chai Wah Wu, Jul 19 2022

A000120(a(n)) = 3.

A057221 Numbers k such that 2^k + 19 is prime.

Original entry on oeis.org

2, 6, 30, 162, 654, 714, 1370, 1662, 1722, 2810, 77142, 156254, 432974, 1092242, 1245230

Offset: 1

Robert G. Wilson v, Sep 17 2000

a(14) > 5*10^5. - Robert Price, Aug 27 2015
All terms are even. - Robert Israel, Aug 28 2015
For numbers k in this sequence, the number 2^(k-1)*(2^k+19) has deficiency 20 (see A223607). - M. F. Hasler, Jul 18 2016

Henri Lifchitz and Renaud Lifchitz (Editors), Search for 2^n+19, PRP Top Records.

Cf. A223607, A253774.

Cf. A019434 (primes 2^k+1), A057732 (2^k+3), A059242 (2^k+5), A057195 (2^k+7), A057196(2^k+9), A102633 (2^k+11), A102634 (2^k+13), A057197 (2^k+15), A057200 (2^k+17), this sequence (2^k+19), A057201 (2^k+21), A057203 (2^k+23).

[n: n in [0..1000] | IsPrime(2^n+19)]; // Vincenzo Librandi, Aug 28 2015

select(n -> isprime(2^n+19), [seq(2*i,i=1..10000)]); # Robert Israel, Aug 28 2015

Do[ If[ PrimeQ[ 2^n + 19 ], Print[ n ] ], {n, 1, 15000} ]
Select[Range[10000], PrimeQ[2^# + 19] &] (* Vincenzo Librandi, Aug 28 2015 *)

for(n=1,oo,ispseudoprime(2^n+19)&&print1(n",")) \\ M. F. Hasler, Jul 18 2016

a(n) = 2*A253774(n). - Joerg Arndt, Aug 28 2015

a(11)-a(13) from Robert Price, Aug 27 2015
Edited by M. F. Hasler, Jul 18 2016
a(14)-a(15) found by Stefano Morozzi, added by Elmo R. Oliveira, Nov 19 2023

A125246 Numbers m whose abundance sigma(m) - 2m = -4. Numbers whose deficiency is 4.

Original entry on oeis.org

5, 14, 44, 110, 152, 884, 2144, 8384, 18632, 116624, 8394752, 15370304, 73995392, 536920064, 2147581952, 34360131584, 27034175140420610, 36028797421617152, 576460753914036224

Offset: 1

Jason G. Wurtzel, Nov 25 2006

a(17) > 10^12. - Donovan Johnson, Dec 08 2011
a(17) > 10^13. - Giovanni Resta, Mar 29 2013
a(17) <= b(28) = 36028797421617152 ~ 3.6*10^16, since b(k) := 2^(k-1)*(2^k+3) is in this sequence for all k in A057732, i.e., whenever 2^k+3 is prime, and 28 = A057732(11). Further terms of this form are b(30), b(55), b(67), b(84), ... The only terms not of the form b(k), below 10^13, are {110, 884, 18632, 116624, 15370304, 73995392}. - M. F. Hasler, Apr 27 2015, edited on Jul 17 2016
See A191363 for numbers with deficiency 2, and A141548 for numbers with deficiency 6. - M. F. Hasler, Jun 29 2016 and Jul 17 2016
A term of this sequence multiplied with a prime p not dividing it is abundant if and only if p < sigma(a(n))/4. For each of a(2..16) there is such a prime, near this limit, such that a(n)*p is a primitive weird number, cf. A002975. - M. F. Hasler, Jul 17 2016
Any term x of this sequence can be combined with any term y of A088832 to satisfy the property (sigma(x)+sigma(y))/(x+y) = 2, which is a necessary (but not sufficient) condition for two numbers to be amicable. - Timothy L. Tiffin, Sep 13 2016
Is 5 the only odd number in this sequence? Is it possible to prove this? - M. F. Hasler, Feb 22 2017
a(20) > 10^18. - Hiroaki Yamanouchi, Aug 21 2018
If m is an even term, then (m-2)/2 is a term of A067680. - Jinyuan Wang, Apr 08 2020

			The abundance of 5 = (1+5)-10 = -4.
More generally, whenever p = 2^k + 3 is prime (as p = 5 for k = 1), then A(2^(k-1)*p) = (2^k-1)*(p+1) - 2^k*p = 2^k - p - 1 = -4.

Cf. A033880, A057732, A067680, A191363, A141548, A125247, A125248, A088832 (abundance 4).

[n: n in [1..9*10^6] | (SumOfDivisors(n)-2*n) eq -4]; // Vincenzo Librandi, Sep 15 2016

Select[Range[10^7], DivisorSigma[1, #] - 2 # == -4 &] (* Michael De Vlieger, Jul 18 2016 *)

for(n=1,1000000,if(((sigma(n)-2*n)==-4),print1(n,",")))

a(11) to a(14) from Klaus Brockhaus, Nov 29 2006
a(15)-a(16) from Donovan Johnson, Dec 23 2008
a(17)-a(19) from Hiroaki Yamanouchi, Aug 21 2018

A157007 Numbers k such that 2^k + 27 is prime.

Original entry on oeis.org

1, 2, 4, 5, 8, 10, 13, 14, 16, 40, 41, 44, 86, 110, 125, 133, 134, 145, 154, 184, 194, 301, 308, 320, 685, 1001, 1066, 1496, 1633, 2005, 2864, 3241, 6286, 11585, 12854, 16514, 16540, 19246, 24538, 28705, 57644, 65366, 85276, 89113, 194854, 266680, 376790, 478088

Offset: 1

Edwin Dyke (ed.dyke(AT)btinternet.com), Feb 20 2009

nonn

a(49) > 5*10^5. - Robert Price, Nov 06 2015

			For k = 1, 2^1 + 27 = 29.
For k = 2, 2^2 + 27 = 31.
For k = 4, 2^4 + 27 = 43.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n+27, PRP Top Records.

Cf. A057733, A094076, A104071, A123250.

Cf. A019434 (primes 2^k+1), A057732 (2^k+3), A059242 (2^k+5), A057195 (2^k+7), A057196 (2^k+9), A102633 (2^k+11), A102634 (2^k+13), A057197 (2^k+15), A057200 (2^k+17), A057221 (2^k+19), A057201 (2^k+21), A057203 (2^k+23), A157006 (2^k+25), this sequence (2^k+27), A156982 (2^k+29), A247952 (2^k+31), A247953 (2^k+33), A220077 (2^k+35).

[n: n in [0..1000] | IsPrime(2^n+27)]; // Vincenzo Librandi, Oct 05 2015

Delete[Union[Table[If[PrimeQ[2^n + 27], n, 0], {n, 1, 2000}]], 1]
Select[Range[5000],PrimeQ[2^#+27]&] (* Harvey P. Dale, Mar 24 2011 *)

for(n=1, 1e3, if(isprime(2^n+3^3), print1(n", "))) \\ Altug Alkan, Oct 04 2015

More terms from Harvey P. Dale, Mar 24 2011
a(33)-a(42) from Robert Price, Oct 04 2015
a(43)-a(47) discovered by Henri Lifchitz and Lelio R Paula from Lifchitz link by Robert Price, Oct 04 2015
a(48) from Robert Price, Nov 06 2015

A247952 Numbers k such that 2^k + 31 is prime.

Original entry on oeis.org

4, 12, 36, 540, 844, 1192, 12136, 84280, 128356, 317464, 3018556

Offset: 1

Vincenzo Librandi, Sep 28 2014

Some terms correspond to probable primes. Lifchitz link shows Paul Underwood discovered 84280, and Lelio R Paula found 128356 and 317464 are in the sequence. - Jens Kruse Andersen, Sep 29 2014
a(11) > 5*10^5. - Robert Price, Oct 25 2015
All terms are even. - Elmo R. Oliveira, Nov 25 2023

Henri Lifchitz and Renaud Lifchitz, Search for 2^n+31, PRP Top Records.

Cf. A094076, A262971.

Cf. Numbers k such that 2^k + d is prime: (0,1,2,4,8,16) for d=1; A057732 (d=3), A059242 (d=5), A057195 (d=7), A057196 (d=9), A102633 (d=11), A102634 (d=13), A057197 (d=15), A057200 (d=17), A057221 (d=19), A057201 (d=21), A057203 (d=23), A157006 (d=25), A157007 (d=27), A156982 (d=29), this sequence (d=31), A247953 (d=33), A220077 (d=35).

Magma
```
[n: n in [0..2000]| IsPrime(2^n+31)];
```

Select[Range[0,10000], PrimeQ[2^# + 31] &]

is(n)=ispseudoprime(2^n+31) \\ Charles R Greathouse IV, May 22 2017

a(n) = 2*A262971(n). - Elmo R. Oliveira, Nov 25 2023

12136 and 84280 from Jens Kruse Andersen, Sep 29 2014
a(9)-a(10) (discovered by Lelio R Paula; see the Lifchitz link) added by Robert Price, Oct 04 2015
a(11) discovered by Robert Price, added by Elmo R. Oliveira, Nov 25 2023

A247953 Numbers k such that 2^k + 33 is prime.

Original entry on oeis.org

2, 3, 6, 11, 12, 14, 15, 20, 30, 60, 68, 75, 108, 116, 135, 206, 210, 410, 446, 558, 851, 1482, 1499, 2039, 2051, 4196, 7046, 7155, 8735, 10619, 18420, 20039, 46719, 75348, 179790, 203018, 434246

Offset: 1

Vincenzo Librandi, Sep 28 2014

Some terms correspond to probable primes. Lifchitz link shows the terms 179790 found by Donovan Johnson and 203018 by Lelio R Paula. - Jens Kruse Andersen, Sep 30 2014

a(38) > 5*10^5. - Robert Price, Nov 07 2015

Henri Lifchitz and Renaud Lifchitz, Search for 2^n+33, PRP Top Records.

Cf. A094076, A176926, A247957.

Cf. Numbers k such that 2^k + d is prime: (0,1,2,4,8,16) for d=1; A057732 (d=3), A059242 (d=5), A057195 (d=7), A057196 (d=9), A102633 (d=11), A102634 (d=13), A057197 (d=15), A057200 (d=17), A057221 (d=19), A057201 (d=21), A057203 (d=23), A157006 (d=25), A157007 (d=27), A156982 (d=29), A247952 (d=31), this sequence (d=33), A220077 (d=35).

/* The code gives only the terms up to 851: */ [n: n in [1..1400]| IsPrime( 2^n + 33 )];

A247957:=n->`if`(isprime(2^n+33),n,NULL): seq(A247957(n), n=0..1000); # Wesley Ivan Hurt, Sep 28 2014

Select[Range[10000], PrimeQ[2^# + 33] &]

is(n)=ispseudoprime(2^n+33) \\ Charles R Greathouse IV, Feb 20 2017

a(30)-a(34) from Jens Kruse Andersen, Sep 30 2014
a(35)-a(36) (discovered by Donovan Johnson and Lelio R Paula, respectively; see the Lifchitz link) added by Robert Price, Oct 04 2015
a(37) from Robert Price, Nov 07 2015

A156982 Numbers k such that 2^k + 29 is prime.

Original entry on oeis.org

1, 3, 5, 7, 9, 13, 15, 17, 23, 27, 33, 37, 43, 63, 69, 73, 79, 89, 117, 127, 239, 395, 409, 465, 837, 2543, 10465, 10837, 17005, 19285, 24749, 26473, 29879, 49197, 56673, 67119, 67689, 71007, 109393, 156403, 158757, 181913, 190945, 207865, 222943, 419637

Offset: 1

Edwin Dyke (ed.dyke(AT)btinternet.com), Feb 20 2009

nonn

n cannot be of the form 4m+2 or 4m because 2^(2m+2) + 29 is divisible by 3 and 2^4m + 29 is divisible by 15. - Avik Roy (avik_3.1416(AT)yahoo.co.in), Feb 21 2009

a(47) > 5*10^5. - Robert Price, Oct 25 2015

			For k = 1, 2^1 + 29 = 31.
For k = 3, 2^3 + 29 = 37.

Henri Lifchitz and Renaud Lifchitz, PRP Records, search for 2^n+29

Cf. A019434 (Fermat primes 2^(2^n)+1).

Cf. A057732, A059242, A057195, A057196, A102633, A102634, A057197, A057200, A057221, A057201, A057203, A157006, A157007, A247952, A247953, A220077.

[n: n in [0..1000] | IsPrime(2^n+29)]; // Vincenzo Librandi, Oct 05 2015

Delete[Union[Table[If[PrimeQ[2^n + 29], n, 0], {n, 1, 2600}]], 1]
Select[Range[500000], PrimeQ[2^#+29]&] (* Robert Price, Oct 04 2015 *)

is(n)=ispseudoprime(2^n+29) \\ Charles R Greathouse IV, Jun 06 2017

a(27)-a(38) from Robert Price, Oct 04 2015

a(39)-a(46) discovered by Henri Lifchitz from Lifchitz link by Robert Price, Oct 04 2015

A157006 Numbers k such that 2^k + 25 is prime.

Original entry on oeis.org

2, 4, 6, 8, 10, 20, 22, 34, 70, 92, 112, 118, 236, 250, 378, 438, 570, 654, 800, 1636, 2848, 4948, 5670, 6772, 7494, 8006, 9056, 11038, 16268, 21416, 21738, 33370, 78706, 112130, 126446, 164046, 219250, 236432, 368048, 524154, 530810, 640854, 699740, 746302, 754038, 754376, 931976, 989562

Offset: 1

Edwin Dyke (ed.dyke(AT)btinternet.com), Feb 20 2009

nonn

a(40) > 5*10^5. - Robert Price, Oct 15 2015

Since each term is even (n = 2*k), prime numbers of the form 2^k + 25 (see A104072) also have the form 4^k + 25. Those values of k are given in A204388. - Timothy L. Tiffin, Aug 06 2016

			For k = 2, 2^2 + 25 = 29.
For k = 4, 2^4 + 25 = 41.
For k = 6, 2^6 + 25 = 89.

Henri Lifchitz and Renaud Lifchitz, Search for 2^n+25, PRP Top Records.

Cf. A094076, A104072, A123250, A204388.

Cf. A019434 (primes 2^k+1), A057732 (2^k+3), A059242 (2^k+5), A057195 (2^k+7), A057196 (2^k+9), A102633 (2^k+11), A102634 (2^k+13), A057197 (2^k+15), A057200 (2^k+17), A057221 (2^k+19), A057201 (2^k+21), A057203 (2^k+23), this sequence (2^k+25), A157007 (2^k+27), A156982 (2^k+29), A247952 (2^k+31), A247953 (2^k+33), A220077 (2^k+35).

[n: n in [1..1000] | IsPrime(2^n+25)]; // Vincenzo Librandi, Aug 07 2016

Delete[Union[Table[If[PrimeQ[2^n + 25], n, 0], {n, 1, 1000}]], 1]
Select[Range[0, 10000], PrimeQ[2^# + 25] &] (* Vincenzo Librandi, Aug 07 2016 *)

is(n)=ispseudoprime(2^n+5^2) \\ Charles R Greathouse IV, Feb 20 2017

a(n) = 2*A204388(n). - Timothy L. Tiffin, Aug 09 2016

Extended by Vladimir Joseph Stephan Orlovsky, Feb 27 2011
a(29)-a(39) from Robert Price, Oct 15 2015
a(40)-a(48) found by Stefano Morozzi, added by Elmo R. Oliveira, Nov 25 2023

A220077 Numbers k such that 2^k + 35 is prime.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 15, 25, 33, 57, 117, 133, 189, 195, 263, 273, 287, 509, 693, 1087, 1145, 1159, 1845, 2743, 3275, 12223, 26263, 31425, 44359, 48003, 49251, 62557, 113877, 114507, 132865, 165789, 192549, 348437, 426043, 436365, 471043, 480417

Offset: 1

Vincenzo Librandi, Dec 04 2012

nonn

Some terms correspond to probable primes. Lifchitz link shows Lelio R Paula found the terms 132865, 165789, 192549, 348437. - Jens Kruse Andersen, Oct 01 2014
a(43) > 5*10^5. - Robert Price, Nov 01 2015
All terms are odd. - Elmo R. Oliveira, Nov 27 2023

Henri Lifchitz and Renaud Lifchitz, Search for 2^n+35, PRP Top Records.

Cf. A094076, A176927.

Cf. Numbers k such that 2^k + d is prime: (0,1,2,4,8,16) for d=1; A057732 (d=3), A059242 (d=5), A057195 (d=7), A057196 (d=9), A102633 (d=11), A102634 (d=13), A057197 (d=15), A057200 (d=17), A057221 (d=19), A057201 (d=21), A057203 (d=23), A157006 (d=25), A157007 (d=27), A156982 (d=29), A247952 (d=31), A247953 (d=33), this sequence (d=35).

Mathematica
```
Select[Range[5000],PrimeQ[2^# + 35] &]
```

for(n=1, 10^30, if (isprime(2^n + 35), print1(n", "))); \\ Altug Alkan, Oct 05 2015

a(26)-a(34) from Jens Kruse Andersen, Oct 01 2014
132865, 165789, 192549, 348437 discovered by Lelio R Paula confirmed as a(35)-a(38) by Robert Price, Oct 05 2015
a(39)-a(42) from Robert Price, Nov 01 2015

cp's OEIS Frontend

A057203 Numbers k such that 2^k + 23 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A081091 Primes of the form 2^i + 2^j + 1, i > j > 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Python

Formula

A057221 Numbers k such that 2^k + 19 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A125246 Numbers m whose abundance sigma(m) - 2m = -4. Numbers whose deficiency is 4.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions

A157007 Numbers k such that 2^k + 27 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions

A247952 Numbers k such that 2^k + 31 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI