A244563 -id:A244563 - cp's OEIS frontend

A244564 Odd integers n such that for every integer k>0, n * 2^k + 1 has a divisor in the set { 3, 5, 7, 13, 19, 73, 109 }.

934909, 1259779, 6828631, 11822359, 12151397, 15285707, 17220887, 23277113, 25912463, 32971909, 34689511, 38206517, 38257411, 45181667, 46337843, 48339497, 57410477, 63676073, 67510217, 68468753, 68708387, 69169397, 70312793, 71151293

Offset: 1

Pierre CAMI, Jun 30 2014

nonn

For n > 144, a(n) = a(n-144) + 412729590, the first 144 values are in the table.

Pierre CAMI, Table of n, a(n) for n = 1..144

Cf. A076336, A244073, A244561, A244562, A244563.

For n > 144, a(n) = a(n-144) + 412729590.

A244565 Odd integers n such that for every integer k>0, n*2^k+1 has a divisor in the set { 3, 5, 7, 13, 37, 73, 109 }.

Original entry on oeis.org

322523, 12413281, 16921847, 27862127, 29095681, 35430841, 43925747, 47635073, 50273851, 56517767, 57816799, 59929127, 60666107, 63662611, 66887071, 69265069, 77564731, 83460571, 87376127, 104697533

Offset: 1

Pierre CAMI, Jun 30 2014

nonn

For n > 144, a(n) = a(n-144) + 803736570, the first 144 values are in the table.

Pierre CAMI, Table of n, a(n) for n = 1..144

Cf. A076336, A244074, A244561, A244562, A244563, A244564.

For n > 144, a(n) = a(n-144) + 803736570.

A244566 Odd integers n such that for every integer k>0, n*2^k+1 has a divisor in the set { 3, 5, 7, 13, 17, 97, 257 }.

Original entry on oeis.org

327739, 5455789, 8879993, 9043831, 21823667, 25763447, 29949559, 75037639, 92732027, 119863547, 119879899, 122091961, 146880319, 151060223, 152106751, 163378771, 181339441, 182384417, 182646049, 218039041, 232190537

Offset: 1

Pierre CAMI, Jun 30 2014

These are the Sierpiński numbers (A076336) with covering set {3, 5, 7, 13, 17, 97, 257}. - David W. Wilson, Jul 18 2014

For n > 96, a(n) = a(n-96) + 1156954890, the first 96 values are in the table.

Pierre CAMI, Table of n, a(n) for n = 1..96

Cf. A076336, A244076, A244561, A244562, A244563, A244564, A244565.

is(n)=my(G=578477445,t=Mod(n,G)); for(k=1,768,t*=2; if(gcd(t+1, G)==1, return(0))); n%2 \\ Charles R Greathouse IV, Jul 18 2014

For n > 96, a(n) = a(n-96) + 1156954890.

cp's OEIS Frontend

A244564 Odd integers n such that for every integer k>0, n * 2^k + 1 has a divisor in the set { 3, 5, 7, 13, 19, 73, 109 }.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A244565 Odd integers n such that for every integer k>0, n*2^k+1 has a divisor in the set { 3, 5, 7, 13, 37, 73, 109 }.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A244566 Odd integers n such that for every integer k>0, n*2^k+1 has a divisor in the set { 3, 5, 7, 13, 17, 97, 257 }.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula