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 A145674 #8 Dec 23 2024 22:40:55
%S A145674 2,5,7,17,13,19,23,53,31,43,41,59,79,67,71,137,151,157,127,131,149,
%T A145674 181,167,233,197,211,199,241,229,239,479,419,457,449,283,293,313,349,
%U A145674 337,401,359,367,373,397,389,463,421,727,653,661,719,701,523,647,571,631,617,619,607,643,659,691,1453,739,1283,1429,761,769
%N A145674 a(n) = largest member of the n-th term in S(3) (defined in Comments).
%C A145674 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 A145674 Max Alekseyev, <a href="/A145674/b145674.txt">Table of n, a(n) for n = 1..100000</a>
%Y A145674 Cf. A145667, A145668, A145669, A145670, A145671, A145672, A145673, A158576, A158577, A158578, A158579.
%K A145674 nonn,base
%O A145674 1,1
%A A145674 _W. Edwin Clark_, Mar 17 2009
%E A145674 More terms from _Max Alekseyev_, May 12 2011