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 A145669 #9 Dec 24 2024 08:44:30
%S A145669 2,5,11,13,17,37,41,67,73,107,127,131,149,173,191,193,211,223,233,239,
%T A145669 241,251,257,263,277,281,337,349,353,373,419,431,443,491,509,521,541,
%U A145669 547,557,613,653,661,683,701,709,719,733,761,769,787,853,877,907,1019,1031,1091,1093,1153,1163,1187,1193,1201,1259,1381,1433,1451,1453,1553,1597,1637,1657,1709,1721,1753,1759,1777,1783,1811,1889,1907,1931,1973,2027
%N A145669 a(n) = smallest member of the n-th term in S(2) (defined in Comments).
%C A145669 Let H(L,b) be the Hamming graph whose vertices are the sequences of length L over the alphabet {0,1,...,b-1} with adjacency being defined by having Hamming distance 1. Let P(L,b) be the subgraph of H(L,b) induced by the set of vertices which are base b representations of primes with L digits (not allowing leading 0 digits). Let S(b) be the sequence of all components of the graphs P(L,b), L>0, sorted by the smallest prime in a component.
%H A145669 Max Alekseyev, <a href="/A145669/b145669.txt">Table of n, a(n) for n = 1..100000</a>
%Y A145669 Cf. A104080, A014234, A145667, A145668, A145670, A145671, A145672, A145673, A145674, A158576, A158577, A158578, A158579.
%K A145669 nonn,base
%O A145669 1,1
%A A145669 _W. Edwin Clark_, Mar 17 2009
%E A145669 More terms from _Max Alekseyev_, May 12 2011