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 A102010 #16 Feb 01 2023 21:53:56 %S A102010 0,1,3,13,24,31,55,61,810,811,1083,2532,11923,49551 %N A102010 Indices of primes in sequence defined by A(0) = 17, A(n) = 10*A(n-1) - 43 for n > 0. %C A102010 Numbers n such that (110*10^n + 43)/9 is prime. %C A102010 Numbers n such that digit 1 followed by n >= 0 occurrences of digit 2 followed by digit 7 is prime. %C A102010 Numbers corresponding to terms <= 811 are certified primes. %C A102010 a(15) > 10^5. - _Robert Price_, Jan 16 2015 %C A102010 a(15) > 2*10^5. - _Tyler Busby_, Feb 01 2023 %D A102010 Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467. %H A102010 Makoto Kamada, <a href="https://stdkmd.net/nrr/1/12227.htm#prime">Prime numbers of the form 122...227</a>. %H A102010 <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>. %F A102010 a(n) = A102930(n) - 1. %e A102010 12227 is prime, hence 3 is a term. %o A102010 (PARI) a=17;for(n=0,1500,if(isprime(a),print1(n,","));a=10*a-43) %o A102010 (PARI) for(n=0,1500,if(isprime((110*10^n+43)/9),print1(n,","))) %Y A102010 Cf. A000533, A002275, A102930. %K A102010 nonn,hard,more %O A102010 1,3 %A A102010 _Klaus Brockhaus_ and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 28 2004 %E A102010 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008 %E A102010 a(13)-a(14) derived from A102930 by _Robert Price_, Jan 16 2015