This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A244566 #21 Jun 15 2015 02:29:14
%S A244566 327739,5455789,8879993,9043831,21823667,25763447,29949559,75037639,
%T A244566 92732027,119863547,119879899,122091961,146880319,151060223,152106751,
%U A244566 163378771,181339441,182384417,182646049,218039041,232190537
%N 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 }.
%C A244566 These are the Sierpiński numbers (A076336) with covering set {3, 5, 7, 13, 17, 97, 257}. - _David W. Wilson_, Jul 18 2014
%C A244566 For n > 96, a(n) = a(n-96) + 1156954890, the first 96 values are in the table.
%H A244566 Pierre CAMI, <a href="/A244566/b244566.txt">Table of n, a(n) for n = 1..96</a>
%F A244566 For n > 96, a(n) = a(n-96) + 1156954890.
%o A244566 (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
%Y A244566 Cf. A076336, A244076, A244561, A244562, A244563, A244564, A244565.
%K A244566 nonn,easy
%O A244566 1,1
%A A244566 _Pierre CAMI_, Jun 30 2014