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 A145673 #8 Dec 23 2024 22:37:19
%S A145673 2,3,7,11,13,19,23,29,31,37,41,59,61,67,71,83,97,103,109,113,149,163,
%T A145673 167,173,191,193,199,223,229,239,251,257,271,281,283,293,307,331,337,
%U A145673 347,353,367,373,379,389,409,421,487,491,499,503,521,523,569,571,577,599,601,607,643,659,691,733,739,743,757,761,769,773
%N A145673 a(n) = smallest member of the n-th term in S(3) (defined in Comments).
%C A145673 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 A145673 Max Alekseyev, <a href="/A145673/b145673.txt">Table of n, a(n) for n = 1..100000</a>
%Y A145673 Cf. A145667, A145668, A145669, A145670, A145671, A145672, A145674, A158576, A158577, A158578, A158579.
%K A145673 nonn,base
%O A145673 1,1
%A A145673 _W. Edwin Clark_, Mar 17 2009
%E A145673 More terms from _Max Alekseyev_, May 12 2011