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 A264783 #11 Nov 25 2015 21:18:22 %S A264783 2,31,41,43,71,73,89,103,113,127,151,157,223,229,233,241,251,257,263, %T A264783 277,311,313,331,337,353,359,397,409,431,449,487,499,521,571,577,599, %U A264783 607,631,641,643,647,673,683,691,719,727,739,769,809,811,839,857,863,881,911,919,929,937,953,971,983,1009,1013,1021,1031,1033,1049,1051,1063,1069,1087,1093,1097,1103,1151,1153,1163,1181,1193,1201,1217,1223,1231,1249,1279,1289,1297,1321,1327,1367,1399,1409,1423,1429,1433,1439,1447 %N A264783 Primes that do not divide 2^m - 2293 for any positive integer m. %H A264783 Robert Israel, <a href="/A264783/b264783.txt">Table of n, a(n) for n = 1..10000</a> %H A264783 See some related discussion here: http://math.stackexchange.com/questions/1529814/2i-2293-is-always-composite %p A264783 select(t -> isprime(t) and numtheory:-mlog(2293,2,t) = FAIL, [2,seq(t,t=3..2000,2)]); # _Robert Israel_, Nov 25 2015 %K A264783 nonn %O A264783 1,1 %A A264783 _James R. Buddenhagen_, Nov 24 2015