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 A295014 #13 Jan 22 2018 03:01:45
%S A295014 20202,20203,20205,20207,20211,20213,20217,20219,20223,20229,20231,
%T A295014 20237,20241,20243,20247,20253,20259,20302,20303,20305,20307,20311,
%U A295014 20313,20317,20319,20323,20329,20331,20337,20341,20343,20347,20353,20359,20502,20503
%N A295014 Prime time numbers on 6-digit clocks: numbers of the form HMMSS where H, MM, SS are primes, H < 24, MM and SS < 60.
%C A295014 The primes in this sequence form the subsequence A295013, a variant and subsequence of A229106, where only the concatenation HMMSS but not the individual digit groups are required to be primes. See also A050246 and A159911 for 4-digit clock variants.
%C A295014 See A295011 for the subsequence of terms for which the number of seconds after midnight (3600*H + 60*MM + SS, given in A295004) is prime, and A295000 for the subsequence of primes therein.
%H A295014 M. F. Hasler, <a href="/A295014/b295014.txt">Table of n, a(n) for n = 1..2601</a> (complete sequence).
%t A295014 With[{s = Prime@ Range@ PrimePi@ 60}, FromDigits@ Flatten[PadLeft[IntegerDigits[#], 2] & /@ #] & /@ Tuples@ {TakeWhile[s, # < 24 &], s, s}] (* _Michael De Vlieger_, Jan 21 2018 *)
%o A295014 (PARI) is_A295014(n)=apply(isprime,digits(n,100))==[1,1,1]&&n<24e4
%o A295014 A295014 = select( is_A295014, [20000,240000])
%o A295014 /* alternatively */ A295014=List(); forprime(h=0,24,forprime(m=0,60,forprime(s=0,60,listput(A295014,(h*100+m)*100+s))))
%Y A295014 Cf. A295013, A050246, A159911, A229106.
%K A295014 nonn,base,fini,full
%O A295014 1,1
%A A295014 _M. F. Hasler_, Jan 09 2018