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 A247153 #35 Aug 11 2024 14:41:34 %S A247153 2,13,113,1193,11939,193939,17773937,119139133,111133719913, %T A247153 111119917373,111393733793,1117739771979737 %N A247153 a(n) = smallest prime p for which cyclic digit shifts produce exactly n different primes, or 0 if no such p exists for n. %C A247153 a(n) is equal to the smallest n-digit non-repunit prime in A016114, unless no n-digit non-repunit prime exists in A016114. In that case, the number of digits of a(n), if it exists, must be > n. %C A247153 From _David A. Corneth_, Aug 06 2018: (Start) %C A247153 Do we have leading digit of a(n) <= any digit from a(n)? %C A247153 For n > 1, can a(n) contain a digit d with gcd(10, d) > 1? (End) %C A247153 Smallest prime p such that A262988(p) = n. - _Felix Fröhlich_, Aug 06 2018 %H A247153 P. De Geest, <a href="https://www.worldofnumbers.com/circular.htm">Circular primes</a> %Y A247153 Cf. A016114, A262988. This is column 1 of A317716. %K A247153 nonn,base,more %O A247153 1,1 %A A247153 _Felix Fröhlich_, Nov 21 2014 %E A247153 a(7)-a(8) from P. De Geest's website added by _Felix Fröhlich_, Nov 26 2014 %E A247153 a(9)-a(12) from _Robert G. Wilson v_, Aug 06 2018