|
Search: id:A145669
|
|
|
| A145669 |
|
a(n) = smallest member of the n-th term in S(2) (defined in Comments). |
|
+0
1
|
|
| 2, 5, 11, 13, 17, 37, 41, 67, 73, 107, 127, 131, 149, 173, 191, 193, 211, 223, 233, 239, 241, 251, 257, 263, 277, 281, 337, 349, 353, 373
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
CROSSREFS
|
Cf. A145667-A145674, A104080, A014234.
Sequence in context: A019337 A086518 A156672 this_sequence A139019 A031869 A045360
Adjacent sequences: A145666 A145667 A145668 this_sequence A145670 A145671 A145672
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009
|
|
|
Search completed in 0.002 seconds
|
