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 A073861 #17 Oct 28 2021 12:37:08
%S A073861 3,89,887,9551,31397,492113,4652353,47326693,436273009,4302407359,
%T A073861 42652618343,738832927927,7177162611713,90874329411493,
%U A073861 218209405436543,1693182318746371,80873624627234849,804212830686677669
%N A073861 Smaller of pair of successive n-digit primes with maximal difference.
%C A073861 A subsequence of A002386 (assuming that there is an n-digit term in A002386 for all values of n). - _M. F. Hasler_, Apr 28 2014
%H A073861 Thomas R. Nicely, <a href="https://faculty.lynchburg.edu/~nicely/gaps/gaplist.html">First occurrence prime gaps</a> [For local copy see A000101]
%F A073861 A073861 = A000040 o A241623. - _M. F. Hasler_, Apr 28 2014
%F A073861 a(n) = max { p in A002386 | nextprime(p) < 10^n } (under the assumption given in the comment). - _M. F. Hasler_, Apr 28 2014
%e A073861 a(3) = 887, the next prime is 907, 907-887=20 is the maximal possible difference of two 3-digit primes and no smaller pair exhibits this property.
%t A073861 Table[Last[Sort[{#[[2]]-#[[1]],#[[1]],#[[2]]}&/@Partition[Prime[Range[PrimePi[10^i]+1,PrimePi[10^(i+1)]]],2,1]]][[2]],{i,7}] (* _Harvey P. Dale_, Jan 23 2010 *)
%K A073861 base,nonn
%O A073861 1,1
%A A073861 _Amarnath Murthy_, Aug 15 2002
%E A073861 Corrected error and added terms _Harvey P. Dale_, Jan 23 2010
%E A073861 a(9)-a(18) from _Donovan Johnson_, Nov 29 2010