OFFSET
1,1
COMMENTS
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.
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..37356
CROSSREFS
KEYWORD
base,hard,nonn
AUTHOR
W. Edwin Clark, Mar 21 2009
EXTENSIONS
Corrected and terms a(28) onward added by Max Alekseyev, Dec 23 2024
STATUS
approved