|
Search: id:A145674
|
|
|
| A145674 |
|
a(n) = largest member of the n-th term in S(3) (defined in Comments). |
|
+0
12
|
|
| 2, 5, 7, 17, 13, 19, 23, 53, 31, 43, 41, 59, 79, 67, 71, 137, 151, 157, 127, 131, 149, 181, 167, 233, 197, 211, 199, 241, 229, 239
(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.
Sequence in context: A075881 A089727 A113514 this_sequence A067161 A101150 A038875
Adjacent sequences: A145671 A145672 A145673 this_sequence A145675 A145676 A145677
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009
|
|
|
Search completed in 0.002 seconds
|
