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 A024768 #15 Aug 09 2017 02:48:26
%S A024768 2,3,5,7,21,23,27,35,37,51,53,57,73,75,211,213,235,277,351,357,373,
%T A024768 513,533,535,573,577,737,753,2111,2117,2135,2353,2773,3513,3517,3571,
%U A024768 3733,5331,5355,5735,5773,7371,7531,7533,21113,21117,21177,21355,23537,27733
%N A024768 Prefix primes in base 8 (written in base 8).
%C A024768 The final term is a(68) = 21117717.
%H A024768 Nathaniel Johnston, <a href="/A024768/b024768.txt">Table of n, a(n) for n = 1..68</a> (full sequence)
%p A024768 s:=[1,3,5,7]: a:=[[2],[3],[5],[7]]: l1:=1: l2:=4: do for j from l1 to l2 do for k from 1 to 4 do d:=[s[k], op(a[j])]: if(isprime(op(convert(d, base, 8, 8^nops(d)))))then a:=[op(a), d]: fi: od: od: l1:=l2+1: l2:=nops(a): if(l1>l2)then break: fi: od: for j from 1 to nops(a) do printf("%d, ", op(convert(a[j], base, 10, 10^nops(a[j])))); od: # _Nathaniel Johnston_, Jun 22 2011
%Y A024768 Cf. A024763, A024764, A024765, A024766, A024767, A024769, A024770.
%K A024768 nonn,base,easy,fini,full
%O A024768 1,1
%A A024768 _David W. Wilson_