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 A093350 #22 Apr 29 2025 13:36:43 %S A093350 19,71,97,149,227,331,383,409,461,487,617,643,773,877,929,1033,1163, %T A093350 1319,1423,1553,1579,1657,1709,1787,2099,2203,2281,2333,2411,2437, %U A093350 2593,2671,2749,2801,2879,2957,3061,3191,3217 %N A093350 Primes congruent to 6 mod 13. %C A093350 Used in a primality test. %C A093350 Primes congruent to 19 mod 26. - _Chai Wah Wu_, Apr 28 2025 %H A093350 Vincenzo Librandi, <a href="/A093350/b093350.txt">Table of n, a(n) for n = 1..1000</a> %H A093350 Chris Caldwell, <a href="https://t5k.org/curios/includes/file.php?file=primetest.html">Prime Test</a>. %p A093350 p:=proc(n) if isprime(n)=true and n mod 13 = 6 then n else fi end:seq(p(n), n=1..4500); # _Emeric Deutsch_, Feb 28 2005 %t A093350 Select[Range[6, 20000, 13], PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Jun 18 2011 *) %o A093350 (Magma) [p: p in PrimesUpTo(4500) | p mod 13 eq 6 ]; // _Vincenzo Librandi_, Aug 14 2012 %o A093350 (PARI) is(n)=isprime(n) && n%13==6 \\ _Charles R Greathouse IV_, Jul 01 2016 %K A093350 nonn,easy %O A093350 1,1 %A A093350 Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Apr 26 2004 %E A093350 Corrected and extended by _Emeric Deutsch_, Feb 28 2005