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 A268705 #14 Jan 23 2021 14:45:42
%S A268705 2,17,277,1777,47777,727777,7477777,77767777,577777777,1777777777,
%T A268705 67777777777,377777777777,7177777777777,17777777777777,
%U A268705 577777777777777,2777777777777777,77777767777777777,377777777777777777,2777777777777777777,71777777777777777777
%N A268705 Smallest n-digit prime having at least n-1 digits equal to 7.
%H A268705 Michel Lagneau, Michael De Vlieger and Robert G. Wilson v, <a href="/A268705/b268705.txt">Table of n, a(n) for n = 1..1125</a>
%t A268705 f[n_] := Block[{k = 0, p = {}, r = 7(10^n - 1)/9, s = Range@ 10 - 8}, While[k < n, AppendTo[p, Select[r + 10^k*s, PrimeQ]]; k++]; p = Min@ Flatten@ p]; f[1] = 2; f[2] = 17; Array[f, 20]
%t A268705 Table[Min[Select[FromDigits/@Flatten[Permutations/@Table[Join[ {n},PadRight[ {},k,7]],{n,0,9}],1],IntegerLength[#]==k+1&&PrimeQ[#]&]],{k,0,20}] (* _Harvey P. Dale_, Jan 23 2021 *)
%Y A268705 Cf. A037067, A241100, A268702 - A268706, A268707, A241206, A266146.
%K A268705 nonn,base
%O A268705 1,1
%A A268705 _Michel Lagneau_, _Michael De Vlieger_ and _Robert G. Wilson v_, Feb 11 2016