|
Search: id:A158577
|
|
|
| A158577 |
|
a(n) = size of the n-th term in S(10) (defined in Comments). |
|
+0
2
|
|
| 4, 21, 143, 1061, 8363, 68900, 1, 1, 1, 1, 1, 1, 586044, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(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
|
A158576-A158579, A145667-A145674
Sequence in context: A087761 A120368 A053482 this_sequence A006879 A163861 A006153
Adjacent sequences: A158574 A158575 A158576 this_sequence A158578 A158579 A158580
|
|
KEYWORD
|
base,hard,more,nonn
|
|
AUTHOR
|
W. Edwin Clark (eclark(AT)math.usf.edu), Mar 21 2009
|
|
|
Search completed in 0.002 seconds
|
