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 A068710 #43 Oct 17 2014 19:45:28
%S A068710 2,3,5,7,23,43,67,89,109,809,1423,2143,2341,2543,4231,4253,4523,4567,
%T A068710 4657,5647,5867,6547,6857,10243,10289,10789,10987,12043,12809,18097,
%U A068710 19087,20143,20341,20431,20981,21089,23041,24103,25463,25643,28019,28109,28901,30241,32401,36457,40123,40213,40231,41023
%N A068710 Primes whose digits can be arranged in increasing cyclic order - to form a substring of 123456789012345678901234567890...
%C A068710 Observe that the digits 0 and 9 do not appear in any 4-digit or 7-digit prime in this sequence. Also note that no 10-digit prime has this form (since the sum of 10 consecutive digits is divisible by 3).
%H A068710 T. D. Noe and David Consiglio, Jr., <a href="/A068710/b068710.txt">Table of n, a(n) for n = 1..9463</a> (terms < 5 x 10^7. The 1287 terms < 10^7 were entered by T. D. Noe.)
%e A068710 2143 is a term as its digits can be arranged as 1234.
%e A068710 109 is a terms since the digits can be permuted to give 901.
%t A068710 cyclicP[n_] := Module[{d = Mod[Range[n + 9], 10], ds, u, i}, ds = Partition[d, n, 1]; u = {}; Do[u = Union[u, Select[FromDigits/@Permutations[ds[[i]]], # > 10^(n - 1) && PrimeQ[#] &]], {i, 10}]; u]; Flatten[Table[cyclicP[n], {n, 7}]]
%Y A068710 Cf. A068708, A068709. See A177119 for a different (and finite) version.
%K A068710 base,nonn
%O A068710 1,1
%A A068710 _Amarnath Murthy_ and V. P. Singh, Mar 05 2002
%E A068710 Jan 22 2011: There were omissions after the term 6857 (10243 for example), so I deleted the terms beyond this point, and the presumably erroneous Mma program that accompanied them. Thanks to Marco Ripà for pointing out that there were errors. - _N. J. A. Sloane_
%E A068710 Corrected by _T. D. Noe_, Jan 24 2011