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 A158579 #7 Dec 23 2024 14:22:24
%S A158579 7,97,997,9973,99991,999983,294001,505447,584141,604171,929573,971767,
%T A158579 9999991,1062599,1282529,1524181,2017963,2474431,2690201,3070663,
%U A158579 3085553,3326489,4393139,5152507,5285767,5564453,5575259,5974249,6173731,6191371,6236179,6463267,6712591,7204777,7469789,7469797,7810223,7858771,7982543,8090057
%N A158579 a(n) = largest member of the n-th term in S(10) (defined in Comments).
%C A158579 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 A158579 Max Alekseyev, <a href="/A158579/b158579.txt">Table of n, a(n) for n = 1..37356</a>
%Y A158579 Cf. A145667, A145668, A145669, A145670, A145671, A145672, A145673, A145674, A158576, A158577, A158578.
%K A158579 base,hard,nonn
%O A158579 1,1
%A A158579 _W. Edwin Clark_, Mar 21 2009
%E A158579 Corrected and terms a(28) onward added by _Max Alekseyev_, Dec 23 2024