|
Search: id:A145672
|
|
|
| A145672 |
|
a(n) = size of the n-th term in S(3) (defined in Comments). |
|
+0
1
|
|
| 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 1, 3, 1, 1, 5, 2, 3, 2, 2, 1, 2, 1, 4, 2, 2, 1, 2, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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: A088203 A061342 A104639 this_sequence A175024 A175023 A128115
Adjacent sequences: A145669 A145670 A145671 this_sequence A145673 A145674 A145675
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009
|
|
|
Search completed in 0.002 seconds
|
