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 A089397 #6 Aug 13 2017 21:40:51
%S A089397 6,82,982,9748,96052,992548
%N A089397 Largest n-digit member of A089395.
%p A089397 with(combinat): ds:=proc(s) local j: RETURN(add(s[j]*10^(j-1),j=1..nops(s))):end: for d from 1 to 6 do sch:=[seq([1,op(i),d+1],i=[[],seq([j],j=2..d)])]: for n from 10^d-1 by -1 to 10^(d-1) do sn:=convert(n,base,10): fl:=0: for s in sch do m:=mul(j,j=[seq(ds(sn[s[i]..s[i+1]-1]),i=1..nops(s)-1)])+1: if not isprime(m) then fl:=1: break fi od: if fl=0 then printf("%d, ",n):break fi od od: # C. Ronaldo
%Y A089397 Cf. A089392, A089393, A089394, A089395, A089396.
%K A089397 base,nonn
%O A089397 1,1
%A A089397 _Amarnath Murthy_, Nov 10 2003
%E A089397 More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 25 2004