|
|
A158578
|
|
a(n) = smallest member of the n-th term in S(10) (defined in Comments).
|
|
2
|
|
|
2, 11, 101, 1009, 10007, 100003, 1000003, 294001, 505447, 584141, 604171, 929573, 971767, 10000019, 1062599, 1282529, 1524181, 2017963, 2474431, 2690201, 3070663, 3085553, 3326489, 4393139, 5152507, 5285767, 5564453, 5575259
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,hard,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|