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 A101503 #21 Oct 01 2024 15:21:39 %S A101503 0,6,10,12,16,28,30,40,42,46,52,58,60,66,76,88,90,100,102,108,118,126, %T A101503 130,132,136,138,142,160,168,172,180,192,208,210,216,220,222,228,238, %U A101503 240,250,256,258,268,276,280,282,292,306,310,312,322,328,336,342,346 %N A101503 Numbers k such that 11*k + 101 is prime. %C A101503 11 is the smallest two-digit prime and 101 is the smallest three-digit prime. %e A101503 If k=0, then 11*0 + 101 = 101 (prime). %e A101503 If k=6, then 11*6 + 101 = 167 (prime). %e A101503 If k=60, then 11*60 + 101 = 761 (prime). %t A101503 Select[Range[0, 300], PrimeQ[11# + 101] &] (* _Stefan Steinerberger_, Feb 28 2006 *) %o A101503 (Magma) [n: n in [0..1000] | IsPrime(11*n + 101)]; // _Vincenzo Librandi_, Nov 17 2010 %o A101503 (PARI) is(n)=isprime(11*n+101) \\ _Charles R Greathouse IV_, Jun 13 2017 %Y A101503 Cf. A101123, A101086. %K A101503 nonn,easy %O A101503 1,2 %A A101503 _Parthasarathy Nambi_, Jan 24 2005 %E A101503 More terms from _Stefan Steinerberger_, Feb 28 2006