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 A202114 #13 Feb 20 2017 14:53:50 %S A202114 0,2,5,6,7,8,9,10,13,16,17,24,26,29,30,31,33,35,42,43,44,47,48,49,51, %T A202114 52,55,58,64,65,68,69,70,75,77,80,82,83,85,86,87,91,93,94,96,97,99, %U A202114 103,104,112,113,114,120,124,126,127,132,134,135,138,140,141 %N A202114 Numbers n such that 90n + 53 is prime. %C A202114 This sequence was generated by adding 12 Fibonacci-like sequences [See: PROG]. Looking at the format 90n+53 modulo 9 and modulo 10 we see that all entries of A142316 have digital root 8 and last digit 3. (Reverting the process is an application of the Chinese remainder theorem.) The 12 Fibonacci-like sequences are generated (via the p and q "seed" values entered into the PERL program) from the base p,q pairs 53*91, 19*17, 37*89, 73*71, 11*13, 29*67, 47*49, 83*31, 23*61, 41*43, 59*7, 77*79. %t A202114 Select[Range[0, 200], PrimeQ[90 # + 53] &] %o A202114 (PARI) is(n)=isprime(90*n+53) \\ _Charles R Greathouse IV_, Feb 20 2017 %Y A202114 Cf. A181732, A198382, A195993, A196000, A196007, A201739, A201734, A201804, A201816, A201817, A201818, A201820, A201822, A202101, A202104, A202105, A202110, A202112, A202113. %K A202114 nonn,easy %O A202114 1,2 %A A202114 _J. W. Helkenberg_, Dec 11 2011