A291360 -id:A291360 - cp's OEIS frontend

A364413 Odd numbers m such that for every k >= 1, m*2^k + 1 has a divisor in the set {3, 7, 11, 19, 31, 37, 41, 61, 73, 109, 151, 331}.

189035277393779, 212050850472529, 618127765127603, 777947701660121, 1171304921532749, 1358735367828947, 1834310020939021, 2357654372323739, 2638037471052913, 3025664372930897, 3935005074246167, 4688754513654559, 4996748200142999, 5425272498782051, 5455203077891285

Offset: 1

Arkadiusz Wesolowski, Jul 23 2023

nonn

Arkadiusz Wesolowski, Table of n, a(n) for n = 1..34560

Cf. A076336, A076335, A180247, A291360, A364412.

For n > 34560, a(n) = a(n-34560) + 10014447295554878022.

A364412 Odd numbers m such that for every k >= 1, m*2^k - 1 has a divisor in the set {3, 7, 11, 19, 31, 37, 41, 61, 73, 109, 151, 331}.

Original entry on oeis.org

144323411864333, 175321252530209, 190779128601685, 316031956469111, 389882208980861, 450590081221877, 2420018284798363, 2715458757443051, 3161282469971861, 3366332338600025, 3643757921262355, 4380746955320089, 4409682697067321, 5089175909950511, 5281690092088615

Offset: 1

Arkadiusz Wesolowski, Jul 23 2023

nonn

Arkadiusz Wesolowski, Table of n, a(n) for n = 1..34560

Cf. A101036, A076335, A180247, A291360, A364413.

For n > 34560, a(n) = a(n-34560) + 10014447295554878022.

A361898 A set of 13 primes that form a covering set for a Sierpiński (or Riesel) number.

Original entry on oeis.org

3, 5, 7, 11, 31, 73, 97, 151, 241, 631, 673, 1321, 23311

Offset: 1

Arkadiusz Wesolowski, Mar 28 2023

A set of primes is called the covering set for the Sierpiński number k if for every positive integer m there is at least one prime in the set which divides k*2^m + 1. Similarly, a set of primes is called the covering set for the Riesel number j if for every positive integer m there is at least one prime in the set which divides j*2^m - 1.

Subset of A296924.

Cf. A076336, A101036, A291360, A361899, A361900.

cp's OEIS Frontend

A364413 Odd numbers m such that for every k >= 1, m*2^k + 1 has a divisor in the set {3, 7, 11, 19, 31, 37, 41, 61, 73, 109, 151, 331}.

Views

Author

Keywords

Links

Crossrefs

Formula

A364412 Odd numbers m such that for every k >= 1, m*2^k - 1 has a divisor in the set {3, 7, 11, 19, 31, 37, 41, 61, 73, 109, 151, 331}.

Views

Author

Keywords

Links

Crossrefs

Formula

A361898 A set of 13 primes that form a covering set for a Sierpiński (or Riesel) number.

Views

Author

Keywords

Comments

Crossrefs