A158578 a(n) = smallest member of the n-th term in S(10) (defined in Comments).

2, 11, 101, 1009, 10007, 100003, 294001, 505447, 584141, 604171, 929573, 971767, 1000003, 1062599, 1282529, 1524181, 2017963, 2474431, 2690201, 3070663, 3085553, 3326489, 4393139, 5152507, 5285767, 5564453, 5575259, 5974249, 6173731, 6191371, 6236179, 6463267, 6712591, 7204777, 7469789, 7469797, 7810223, 7858771, 7982543

Offset: 1

Author

W. Edwin Clark, Mar 21 2009

Keywords

• base
• hard
• nonn

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

Cf. A145667, A145668, A145669, A145670, A145671, A145672, A145673, A145674, A158576, A158577, A158579.

Extensions

Corrected and terms a(28) onward added by Max Alekseyev, Dec 23 2024