login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A145667
a(n) = number of components of the graph P(n,2) (defined in Comments).
13
0, 1, 1, 2, 1, 2, 4, 11, 13, 19, 29, 43, 107, 169, 350, 603, 1134, 2070, 3803, 7502, 13989, 26495, 50826, 97369, 185827, 357307, 690577, 1332382, 2565110, 4958962, 9594425, 18569626, 36009794
OFFSET
1,4
COMMENTS
Let H(n,b) be the Hamming graph whose vertices are the sequences of length n over the alphabet {0,1,...,b-1} with adjacency being defined by having Hamming distance 1. Let P(n,b) be the subgraph of H(n,b) induced by the set of vertices which are base b representations of primes with n digits (not allowing leading 0 digits).
KEYWORD
nonn,base,more
AUTHOR
W. Edwin Clark, Mar 17 2009
EXTENSIONS
a(18)-a(31) from Max Alekseyev, May 12 2011
a(32)-a(33) from Max Alekseyev, Dec 23 2024
STATUS
approved