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 A065074 #33 Apr 03 2023 10:36:10
%S A065074 101,10111,101111,11110111,11111101,101111111,101111111111,
%T A065074 111011111111,111111011111,111111110111,111111111101,
%U A065074 11111111101111111,11111111111111101,101111111111111111,111110111111111111,111111101111111111,111111111111011111,111111111111111011
%N A065074 Near-repunit primes that contain the digit 0.
%H A065074 Alois P. Heinz, <a href="/A065074/b065074.txt">Table of n, a(n) for n = 1..956</a> (this replaces an older b-file by Robert G. Wilson v)
%H A065074 Chris Caldwell, <a href="https://t5k.org/glossary/page.php?sort=Repunit">Repunit</a>
%p A065074 N:= 20: # to get all terms of up to N digits
%p A065074 A:= select(isprime,[seq(seq((10^n-1)/9 - 10^j,j=n-2..1,-1),n=3..N)]); # _Robert Israel_, Jun 23 2015
%t A065074 f[n_] := Block[{lst = {}, r = (10^(n - 1) - 1)/9}, AppendTo[ lst, Select[ FromDigits[ Permutations[ Append[ IntegerDigits@ r, 0]]], PrimeQ@# && # > 100 &]]; Union@ Flatten@ lst]; Array[f, 18] // Flatten (* _Robert G. Wilson v_, Jun 22 2015 *)
%Y A065074 Cf. A004022, A034093, A065083.
%K A065074 nonn,base
%O A065074 1,1
%A A065074 _Robert G. Wilson v_, Nov 19 2001
%E A065074 Name changed by _Arkadiusz Wesolowski_, Sep 23 2011