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 A244924 #10 Apr 25 2016 11:50:03 %S A244924 73520771,108288041,127499219,141239113,160792529,198545797,205293103, %T A244924 217763051,227258803,262056089,269931509,303224819,307060289, %U A244924 353982553,368427809,430034677,525141899,581603107,585721991,600824113,612314921,644606467,718519237,723522461 %N A244924 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, 673 }. %C A244924 For n > 96 a(n) = a(n-96) + 3029691210, the first 96 values are given in the table. %H A244924 Pierre CAMI, <a href="/A244924/b244924.txt">Table of n, a(n) for n = 1..96</a> %F A244924 For n > 96 a(n)=a(n-96) + 3029691210 %o A244924 (PFGW & SCRIPT) %o A244924 SCRIPT %o A244924 DIM k %o A244924 DIM n,73520701 %o A244924 OPENFILEOUT myf,a(n).txt %o A244924 LABEL loop1 %o A244924 SET n,n+2 %o A244924 IF n>3103211981 THEN END %o A244924 SET k,0 %o A244924 LABEL loop2 %o A244924 SET k,k+1 %o A244924 IF k>300 THEN GOTO a %o A244924 IF (n*2^k-1)%3==0 THEN GOTO loop2 %o A244924 IF (n*2^k-1)%5==0 THEN GOTO loop2 %o A244924 IF (n*2^k-1)%7==0 THEN GOTO loop2 %o A244924 IF (n*2^k-1)%13==0 THEN GOTO loop2 %o A244924 IF (n*2^k-1)%17==0 THEN GOTO loop2 %o A244924 IF (n*2^k-1)%97==0 THEN GOTO loop2 %o A244924 IF (n*2^k-1)%673==0 THEN GOTO loop2 %o A244924 GOTO loop1 %o A244924 LABEL a %o A244924 WRITE myf,n %o A244924 GOTO loop1 %Y A244924 Cf. A244070, A244071, A244072, A244073, A244074, A244076. %K A244924 nonn %O A244924 1,1 %A A244924 _Pierre CAMI_, Jul 08 2014