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 A076491 #12 Oct 30 2019 02:19:04
%S A076491 2,3,11,13,101,103,1031,1033,10223,10243,18379,18397,126079,126097,
%T A076491 1206479,1206497,10258379,10258397,102346879,102346897,10127685439,
%U A076491 10127685493
%N A076491 a(2*n), a(2*n+1) is the smallest consecutive prime pairs with at least n distinct common decimal digits.
%C A076491 If the common digits were not required to be distinct, the resulting sequence would be 2, 3, 11, 13, 101, 103, 1013, 1019, 1913, 1931, 18379, 18397, 109279, 109297, 1000213, 1000231, ... - _Giovanni Resta_, Oct 29 2019
%t A076491 aa[n_] := Block[{p,q,cp,cq}, p = NextPrime[10^(n - 1)]; cp = IntegerDigits@ p; While[True, q = NextPrime[p]; cq = IntegerDigits[q]; If[ Length[ Intersection[cp, cq]] >= n, Break[]]; p=q; cp=cq]; {p, q}]; Flatten[aa /@ Range[0, 9]] (* _Giovanni Resta_, Oct 29 2019 *)
%Y A076491 Cf. A006880, A076489, A076490.
%K A076491 nonn,base,fini,full
%O A076491 0,1
%A A076491 _Labos Elemer_, Oct 21 2002
%E A076491 Corrected and extended by _Giovanni Resta_, Oct 29 2019