A103963 -id:A103963 - cp's OEIS frontend

A076335 Brier numbers: numbers that are both Riesel and Sierpiński [Sierpinski], or odd n such that for all k >= 1 the numbers n2^k + 1 and n2^k - 1 are composite.

3316923598096294713661, 10439679896374780276373, 11615103277955704975673, 12607110588854501953787, 17855036657007596110949, 21444598169181578466233, 28960674973436106391349, 32099522445515872473461, 32904995562220857573541

Offset: 1

Olivier Gérard, Nov 07 2002

nonn

a(1), a(4), and a(6)-a(8) computed by Christophe Clavier, Dec 31 2013 (see link below). 10439679896374780276373 had been found earlier in 2013 by Dan Ismailescu and Peter Seho Park (see reference below). a(3), a(5), and a(9) computed in 2014 by Emmanuel Vantieghem.
These are just the smallest examples known - there may be smaller ones.
There are no Brier numbers below 10^9. - Arkadiusz Wesolowski, Aug 03 2009
Other Brier numbers are 143665583045350793098657, 1547374756499590486317191, 3127894363368981760543181, 3780564951798029783879299, but these may not be the /next/ Brier numbers after those shown. From 2002 to 2013 these four numbers were given here as the smallest known Brier numbers, so the new entry A234594 has been created to preserve that fact. - N. J. A. Sloane, Jan 03 2014
143665583045350793098657 computed in 2007 by Michael Filaseta, Carrie Finch, and Mark Kozek.
It is a conjecture that every such number has more than 10 digits. In 2011 I have calculated that for any n < 10^10 there is a k such that either n*2^k + 1 or n*2^k - 1 has all its prime factors greater than 1321. - Arkadiusz Wesolowski, Feb 03 2016 [Editor's note: The comment below states that the conjecture is now proved. - M. F. Hasler, Oct 06 2021]
There are no Brier numbers below 10^10.  For each n < 10^10, there exists at least one prime of the form n*2^k-1 or n*2^k+1 with k <= 356981. The largest necessary prime is 1355477231*2^356981+1. - Kellen Shenton, Oct 25 2020

D. Baczkowski, J. Eitner, C. E. Finch, B. Suminski, and M. Kozek, Polygonal, Sierpinski, and Riesel numbers, Journal of Integer Sequences, 2015 Vol 18. #15.8.1.
Chris Caldwell, The Prime Glossary, Riesel number
Chris Caldwell, The Prime Glossary, Sierpinski number
Christophe Clavier, 14 new Brier numbers
Fred Cohen and J. L. Selfridge, Not every number is the sum or difference of two prime powers, Math. Comput. 29 (1975), pp. 79-81.
P. Erdős, On integers of the form 2^k + p and some related problems, Summa Brasil. Math. 2 (1950), pp. 113-123.
M. Filaseta et al., On Powers Associated with Sierpiński Numbers, Riesel Numbers and Polignac’s Conjecture, Journal of Number Theory, Volume 128, Issue 7, July 2008, Pages 1916-1940. (See pages 9-10)
Michael Filaseta and Jacob Juillerat, Consecutive primes which are widely digitally delicate, arXiv:2101.08898 [math.NT], 2021.
Michael Filaseta, Jacob Juillerat, and Thomas Luckner, Consecutive primes which are widely digitally delicate and Brier numbers, arXiv:2209.10646 [math.NT], 2022. See also Integers (2023) Vol. 23, #A75.
Yves Gallot, A search for some small Brier numbers, 2000.
G. L. Honaker, Jr. and Chris Caldwell, Prime Curios! 6992565235279559197457863
Dan Ismailescu and Peter Seho Park, On Pairwise Intersections of the Fibonacci, Sierpiński, and Riesel Sequences, Journal of Integer Sequences, 16 (2013), #13.9.8.
Joe McLean, Brier Numbers [Cached copy]
Carlos Rivera, Problem 29. Brier numbers, The Prime Puzzles and Problems Connection.
Carlos Rivera, Problem 58. Brier numbers revisited, The Prime Puzzles and Problems Connection.
Carlos Rivera, Problem 68. More on Brier numbers, The Prime Puzzles and Problems Connection.
Carlos Rivera, See here for latest information about progress on this sequence
Eric Weisstein's World of Mathematics, Brier Number

Cf. A194591, A194600, A194603, A194606, A194607, A194608, A194635, A194636, A194637, A194638, A194639, A076336, A076337, A040081, A040076, A103963, A103964, A038699, A050921, A064699, A052333, A003261, A364412, A364413.
A180247 gives the primes.
See also A076336, A076337.
A234594 is the old, incorrect version.

Many terms reported in Problem 29 from "The Prime Problems & Puzzles Connection" from Carlos Rivera, May 30 2010
Entry revised by Arkadiusz Wesolowski, May 17 2012
Entry revised by Carlos Rivera and N. J. A. Sloane, Jan 03 2014
Entry revised by Arkadiusz Wesolowski, Feb 15 2014

A180247 Prime Brier numbers: primes p such that for all k >= 1 the numbers p2^k + 1 and p2^k - 1 are composite.

Original entry on oeis.org

10439679896374780276373, 21444598169181578466233, 105404490005793363299729, 178328409866851219182953, 239365215362656954573813, 378418904967987321998467, 422280395899865397194393, 474362792344501650476113, 490393518369132405769309

Offset: 1

Arkadiusz Wesolowski, Aug 19 2010

nonn

WARNING: These are just the smallest examples known - there may be smaller ones. Even the first term is uncertain. - N. J. A. Sloane, Jun 20 2017
There are no prime Brier numbers below 10^10. - Arkadiusz Wesolowski, Jan 12 2011
It is a conjecture that every such number has more than 11 digits. In 2011 I have calculated that for any prime p < 10^11 there is a k such that either p*2^k + 1 or p*2^k - 1 has all its prime factors greater than 1321. - Arkadiusz Wesolowski, Feb 03 2016
The first term was found by Dan Ismailescu and Peter Seho Park and the next two by Christophe Clavier (see below). See also A076335. - N. J. A. Sloane, Jan 03 2014
a(4)-a(9) computed in 2017 by the author.

D. Baczkowski, J. Eitner, C. E. Finch, B. Suminski, and M. Kozek, Polygonal, Sierpinski, and Riesel numbers, Journal of Integer Sequences, 2015 Vol 18. #15.8.1.
Chris Caldwell, The Prime Glossary, Riesel number
Chris Caldwell, The Prime Glossary, Sierpinski number
Christophe Clavier, 14 new Brier numbers
Fred Cohen and J. L. Selfridge, Not every number is the sum or difference of two prime powers, Math. Comput. 29 (1975), pp. 79-81.
P. Erdős, On integers of the form 2^k + p and some related problems, Summa Brasil. Math. 2 (1950), pp. 113-123.
Yves Gallot, A search for some small Brier numbers, 2000.
G. L. Honaker, Jr. and Chris Caldwell, Prime Curios! 6992565235279559197457863
Dan Ismailescu and Peter Seho Park, On Pairwise Intersections of the Fibonacci, Sierpiński, and Riesel Sequences, Journal of Integer Sequences, 16 (2013), #13.9.8.
Joe McLean, Brier Numbers [Cached copy]
Carlos Rivera, Problem 52. ±p ± 2^n, The Prime Puzzles and Problems Connection.
Eric Weisstein's World of Mathematics, Brier Number

Cf. A194591, A194600, A194603, A194606, A194607, A194608, A194635, A194636, A194637, A194638, A194639, A076336, A076337, A040081, A040076, A103963, A103964, A038699, A050921, A064699, A052333, A003261.

These are the primes in A076335.

Entry revised by N. J. A. Sloane, Jan 03 2014

Entry revised by Arkadiusz Wesolowski, May 29 2017

A194600 Record values in A194591.

Original entry on oeis.org

0, 1, 2, 4, 5, 6, 11, 18, 20, 28, 70, 106, 208, 726, 910, 2906, 7431, 14073, 22394, 41422, 82587, 85461, 356981

Offset: 1

Arkadiusz Wesolowski, Aug 30 2011

Indices of records are given by A217892.

			A194591(59) = 5 since A194591(109) = 6 is the next record value.

Wilfrid Keller, personal communication, 2010.

Chris K. Caldwell, The List of Largest Known Primes, 1355477231 * 2^356981 + 1
Carlos Rivera, Problem 30

Cf. A194591, A194603, A194606, A194607, A194608, A194635, A194636, A194637, A194638, A194639.

Cf. A103963, A103964, A076335, A180247.

l = -1; Flatten[Table[k = 0; While[! PrimeQ[n*2^k - 1] && ! PrimeQ[n*2^k + 1], k++]; If[k > l, l = k, {}], {n, 10^5}]] (* Arkadiusz Wesolowski, Sep 04 2011 *)

a(23)=A194637(22) from Wilfrid Keller, added by Max Alekseyev, Oct 18 2014

A194607 Record values in A194606.

Original entry on oeis.org

0, 1, 2, 4, 5, 6, 11, 17, 20, 28, 70, 99, 150, 726, 7431, 22394, 85461, 191207

Offset: 1

Arkadiusz Wesolowski, Aug 30 2011

The index sequence of this one is 1, 3, 6, 15, 17, 29, 53, 115, 186, 220, 229, 1886, 5344, 5736, 66774, 1087403, 14747671, 158018119.

a(17) was found in 2000 by Wilfrid Keller and a(18) was found in 2003 by Patrick De Geest.

			A194606(53) = 11 since A194606(115) = 17 is the next record value.

Wilfrid Keller, personal communication, 2010.

Chris K. Caldwell, The List of Largest Known Primes, 270704167 * 2^85461 - 1
Chris K. Caldwell, The List of Largest Known Primes, 3296757029 * 2^191207 + 1
Carlos Rivera, Problem 30

Cf. A194591, A194600, A194603, A194606, A194608, A194635, A194636, A194637, A194638, A194639.

Cf. A103963, A103964, A076335, A180247.

l = -1; Flatten[Table[p = Prime[n]; k = 0; While[! PrimeQ[p*2^k - 1] && ! PrimeQ[p*2^k + 1], k++]; If[k > l, l = k, {}], {n, 10^4}]] (* Arkadiusz Wesolowski, Sep 04 2011 *)

A194637 Record values in A194636.

Original entry on oeis.org

0, 1, 2, 4, 5, 6, 11, 18, 20, 28, 70, 106, 150, 726, 2906, 7431, 14073, 22394, 41422, 82587, 85461, 356981

Offset: 1

Arkadiusz Wesolowski, Aug 31 2011

The index sequence is 1, 3, 7, 24, 30, 55, 121, 168, 555, 687, 724, 7447, 26134, 28272, 324802, 419221, 4420051, 8467881, 50302257, 59186640, 135352084, 677738616, ... given by formula (A194639(n)+1)/2.

			A194636(55) = 6 since A194636(121) = 11 is the next record value.

Wilfrid Keller, personal communication, 2010.

Chris K. Caldwell, The List of Largest Known Primes, 1355477231 * 2^356981 + 1
Carlos Rivera, Problem 30

Cf. A194591, A194600, A194603, A194606, A194607, A194608, A194635, A194636, A194638, A194639.

Cf. A103963, A103964, A076335, A180247.

l = -1; Flatten[Table[n = 2*n - 1; k = 0; While[! PrimeQ[n*2^k - 1] && ! PrimeQ[n*2^k + 1], k++]; If[k > l, l = k, {}], {n, 10^5}]] (* Arkadiusz Wesolowski, Sep 04 2011 *)

a(n) = A194591(A194639(n)) = A194636((A194639(n)+1)/2).

a(22) was found in 2002 by Wilfrid Keller.

A103964 Record values in A040076.

Original entry on oeis.org

0, 1, 2, 3, 6, 8, 583, 6393, 9715, 33288, 3321063, 5054502, 31172165

Offset: 1

Lei Zhou, Feb 24 2005

The index sequence of this sequence is 1, 3, 7, 17, 19, 31, 47, 383, 2897. A040076(2897)>8192, not yet found.

A064699 gives where the records occur.

			A040076(1)=0, so a(1)=0;
A040076(3)=1, so a(2)=1;

Cf. A040076, A103963.

k = -1; n = 0; km = k; While[k < 8192, n++; k = 0; cp = n*(2^ k) + 1; While[(! PrimeQ[cp]) && (k < 8192), k++; cp = n*(2^k) + 1]; If[k > km, km = k; Print[{n, km}]]]

Extended by T. D. Noe, Nov 15 2010

a(13) was found by PrimeGrid, added by Richard N. Smith, Jul 15 2019

cp's OEIS Frontend

A076335 Brier numbers: numbers that are both Riesel and Sierpiński [Sierpinski], or odd n such that for all k >= 1 the numbers n*2^k + 1 and n*2^k - 1 are composite.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A180247 Prime Brier numbers: primes p such that for all k >= 1 the numbers p*2^k + 1 and p*2^k - 1 are composite.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A194600 Record values in A194591.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Extensions

A194607 Record values in A194606.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A194637 Record values in A194636.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A103964 Record values in A040076.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A240113 Integers for which the smallest m in A040081 such that n*2^m - 1 is prime (A038699) increases.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A076335 Brier numbers: numbers that are both Riesel and Sierpiński [Sierpinski], or odd n such that for all k >= 1 the numbers n2^k + 1 and n2^k - 1 are composite.

A180247 Prime Brier numbers: primes p such that for all k >= 1 the numbers p2^k + 1 and p2^k - 1 are composite.