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 A256300 #28 Jul 05 2017 02:56:56 %S A256300 2,5,5,7,7,131,1087,1087,1087,3599111 %N A256300 Least prime p such that p+6^k is prime for all k=0,...,n. %C A256300 The function f(k;p) = p+6^k could be termed an example of a non-polynomial prime generating function. %C A256300 Since 6^n (mod 11) cycles through 6,3,7,9,10,5,8,4,2,1,... there is no a(10). - _John Cerkan_, Jul 01 2017 %H A256300 C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_782.htm">Puzzle 782. Prime-Generating non-polynomials</a>, primepuzzles.net, April 4, 2015. %o A256300 (PARI) a(n)=forprime(p=1,,for(i=1,n,ispseudoprime(p+6^i)||next(2));return(p)) %K A256300 nonn,fini,full %O A256300 0,1 %A A256300 _M. F. Hasler_, Apr 05 2015 %E A256300 Keywords fini,full added by _John Cerkan_, Jul 01 2017