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 A158791 #10 Feb 17 2017 16:48:18 %S A158791 0,1,2,3,5,7,8,9,11,12,14,16,18,19,21,22,24,25,28,31,32,33,36,38,39, %T A158791 40,42,45,47,49,50,51,52,53,57,60,63,65,66,68,71,73,74,75,77,79,80,84, %U A158791 87,88,89,91,94,96,98,100,102,106,110,113,117,119,120,126,127,128,130,133 %N A158791 Numbers n such that 30*n + 23 is prime. %C A158791 Encoded primes with LSD 3 and (SOD-1)/3 non-integer, (LSD, least significant digit; SOD, sum of digits). Divide any such number by 30, if the whole number portion of the quotient is in the sequence, the number is prime. %F A158791 a(n) = (A132235(n) - 23)/30 = Floor[A132235(n)/30]. - Chandler %e A158791 Example: 3623, with LSD 3 and (SOD-1)/3 non-integer; Then 3623/30 = 120.766, or 120, which is in the sequence, thus 3623 is prime. %t A158791 Select[Range[0,200],PrimeQ[30#+23]&] (* _Harvey P. Dale_, Jul 31 2014 *) %o A158791 (PARI) is(n)=isprime(30*n+23) \\ _Charles R Greathouse IV_, Feb 17 2017 %Y A158791 Cf. A111175, A158573, A158614, A158648, A158746, A158806, A158850. %K A158791 nonn %O A158791 1,3 %A A158791 _Ki Punches_, Mar 26 2009 %E A158791 Edited by _Ray Chandler_, Apr 07 2009