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 A050246 #36 Feb 16 2025 08:32:40
%S A050246 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,101,103,107,109,113,
%T A050246 127,131,137,139,149,151,157,211,223,227,229,233,239,241,251,257,307,
%U A050246 311,313,317,331,337,347,349,353,359,401,409,419,421,431,433,439,443
%N A050246 Digital clock primes.
%C A050246 The number of minutes past midnight represented by each of the times here can be found in A118848. - _Carl R. White_, May 01 2006
%C A050246 Equals the first 211 terms of A229106, corresponding to interpretation as minutes and seconds what are hours and minutes here. - _M. F. Hasler_, Jan 09 2018
%H A050246 Nathaniel Johnston, <a href="/A050246/b050246.txt">Table of n, a(n) for n = 1..211</a> (full sequence)
%H A050246 Randall Munroe, <a href="https://xkcd.com/247/">Factoring the time</a>, xkcd Web Comic #247, Apr 11 2007.
%H A050246 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ClockPrime.html">Clock Prime.</a>
%F A050246 a(n) = A118848(n) + floor(A118848(n)/60)*40. - _Carl R. White_, May 01 2006
%e A050246 a(143) = 1453 is shown in the last panel of Randall Munroe's Web Comic #247.
%p A050246 for h from 0 to 23 do for m from 0 to 59 do t:=100*h+m: if(isprime(t))then printf("%d, ", t): fi: od: od: # _Nathaniel Johnston_, May 17 2011
%o A050246 (PARI) A050246 = select( t -> t%100 < 60, primes([1,2399])) \\ _M. F. Hasler_, Jan 09 2018
%Y A050246 Cf. A118848, A118849, A118850, A129336, A316603.
%Y A050246 Cf. A159911, where hours H and minutes MM must also be prime, separately.
%K A050246 nonn,easy,base,fini,full
%O A050246 1,1
%A A050246 _Eric W. Weisstein_