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 A247593 #8 Oct 26 2014 14:49:18 %S A247593 5,1009,764051,7346914823 %N A247593 Smallest prime not the middle of one 4 digits longer in base n. %C A247593 a(n), n > 6, is intractable, and a(6) requires extensive resources: There are 360 candidate numbers for any candidate prime, all of which need to be composite, prefixing 30 2-digit numbers and suffixing the 12 ending in either 1 or 5. This compares with 400 for base 5, but in the base-6 case divisibility by 2 and 3 are already ruled out. %e A247593 In base 2--binary, decimal 2 and 3 have representations 10 and 11; and binary 101001 and 101111 represent decimal 41 and 47, so that a(2) > 3. Binary 101--decimal 5--has the 4 binary candidates 1010101, 1010111, 1110101, and 1110111--decimal 85, 87, 117 and 119--requiring consideration for primality, but all are composite: a(2)=5. %o A247593 (PARI) ok(n,b)=my(D=b^#digits(n,b),b2=b^2);forstep(k=b^3*D+n*b2,b2*(b2-1)*D+n*b2,D*b2, if(nextprime(k)<k+b2, return(0))); 1 %o A247593 a(n)=forprime(p=2,,if(ok(p,n), return(p))) \\ _Charles R Greathouse IV_, Sep 20 2014 %Y A247593 Cf. A172514, A247699. %K A247593 nonn,base,more,hard %O A247593 2,1 %A A247593 _James G. Merickel_, Sep 20 2014