The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 }. 1
 327739, 5455789, 8879993, 9043831, 21823667, 25763447, 29949559, 75037639, 92732027, 119863547, 119879899, 122091961, 146880319, 151060223, 152106751, 163378771, 181339441, 182384417, 182646049, 218039041, 232190537 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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. LINKS Pierre CAMI, Table of n, a(n) for n = 1..96 FORMULA For n > 96, a(n) = a(n-96) + 1156954890. PROG (PARI) 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 CROSSREFS Cf. A076336, A244076, A244561, A244562, A244563, A244564, A244565. Sequence in context: A234865 A251438 A251850 * A252037 A237139 A204602 Adjacent sequences: A244563 A244564 A244565 * A244567 A244568 A244569 KEYWORD nonn,easy AUTHOR Pierre CAMI, Jun 30 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 17:03 EST 2023. Contains 367419 sequences. (Running on oeis4.)