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 A056247 #24 Jan 17 2019 13:44:05 %S A056247 0,3,11,15,17,35,51,71,99,6231,24027,40221,66393 %N A056247 Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 51 for n > 0. %C A056247 Numbers n such that (150*10^n - 51)/9 is prime. %C A056247 Numbers n such that digit 1 followed by n >= 0 occurrences of digit 6 followed by digit 1 is prime. %C A056247 Numbers corresponding to terms <= 99 are certified primes. %D A056247 Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467. %H A056247 Patrick De Geest, <a href="http://www.worldofnumbers.com/deplat.htm#pdp161">PDP Reference Table - 161</a>. %H A056247 Makoto Kamada, <a href="https://stdkmd.net/nrr/1/16661.htm#prime">Prime numbers of the form 166...661</a>. %H A056247 <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>. %F A056247 a(n) = A082700(n-1) - 2 for n > 1. %e A056247 16661 is prime, hence 3 is a term. %t A056247 Select[Range[0, 2000], PrimeQ[(150 10^# - 51) / 9] &] (* _Vincenzo Librandi_, Nov 03 2014 *) %o A056247 (PARI) a=11;for(n=0,1500,if(isprime(a),print1(n,","));a=10*a+51) %o A056247 (PARI) for(n=0,1500,if(isprime((150*10^n-51)/9),print1(n,","))) %Y A056247 Cf. A000533, A002275, A068647, A082700. %K A056247 nonn,hard,more %O A056247 1,2 %A A056247 _Robert G. Wilson v_, Aug 18 2000 %E A056247 Additional comments from _Klaus Brockhaus_ and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 28 2004 %E A056247 Edited by _N. J. A. Sloane_, Jun 15 2007 %E A056247 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008 %E A056247 Added one more term from the PDP table and a link, by _Patrick De Geest_, Nov 02 2014 %E A056247 Edited by _Ray Chandler_, Nov 04 2014