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 A105710 #20 Sep 08 2022 08:45:17 %S A105710 0,28,36,70,76,78,106,124,136,168,184,198,208,216,226,234,238,246,258, %T A105710 294,300,304,318,348,364,366,370,394,418,436,454,468,474,496,556,570, %U A105710 588,598,604,616,660,688,696,714,736,738,744,748 %N A105710 Numbers k such that 9973*k + 1009 is prime. %C A105710 1009 and 9973 are the smallest and largest four-digit primes, respectively. %C A105710 The theorem of Dirichlet shows that this sequence is infinite. - _Stefan Steinerberger_, Feb 12 2006 %e A105710 If k=0, then 9973*k + 1009 = 1009 (prime). %e A105710 If k=168, then 9973*k + 1009 = 1676473 (prime). %t A105710 For[n = 1, n < 1000, n++, If[PrimeQ[(9973*n + 1009)], Print[n]]] (* _Stefan Steinerberger_, Feb 12 2006 *) %t A105710 Select[Range[0, 1000], PrimeQ[9973 # + 1009] &] (* _Vincenzo Librandi_, Sep 14 2015 *) %o A105710 (Magma) [n: n in [0..800] | IsPrime(9973*n + 1009)]; // _Vincenzo Librandi_, Sep 14 2015 %o A105710 (PARI) is(n)=isprime(9973*n+1009) \\ _Charles R Greathouse IV_, Feb 17 2017 %Y A105710 Cf. A105679. %K A105710 nonn,easy %O A105710 1,2 %A A105710 _Parthasarathy Nambi_, May 06 2005 %E A105710 More terms from _Stefan Steinerberger_, Feb 12 2006