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

2, 3, 7, 11, 13, 19, 23, 29, 31, 37, 41, 59, 61, 67, 71, 83, 97, 103, 109, 113, 149, 163, 167, 173, 191, 193, 199, 223, 229, 239, 251, 257, 271, 281, 283, 293, 307, 331, 337, 347, 353, 367, 373, 379, 389, 409, 421, 487, 491, 499, 503, 521, 523, 569, 571, 577, 599, 601, 607, 643, 659, 691, 733, 739, 743, 757, 761, 769, 773

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

Table of n, a(n) for n=1..69.

Crossrefs

Cf. A145667-A145674.

Sequence in context: A127430 A171595 A106483 * A321657 A040116 A155153

Adjacent sequences: A145670 A145671 A145672 * A145674 A145675 A145676

Keyword

nonn,base

Author

W. Edwin Clark, Mar 17 2009

Extensions

More terms from Max Alekseyev, May 12 2011

Status

approved