|
Search: id:A145671
|
|
|
| A145671 |
|
a(n) = number of components of the graph P(n,3) (defined in Comments). |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Let H(n,b) be the Hamming graph whose vertices are the sequences of length n over the alphabet {0,1,...,b-1} with adjacency being defined by having Hamming distance 1. Let P(n,b) be the subgraph of H(n,b) induced by the set of vertices which are base b representations of primes with n digits (not allowing leading 0 digits).
|
|
CROSSREFS
|
Cf. A145667-A145674.
Sequence in context: A086125 A061030 A036661 this_sequence A108693 A007673 A026096
Adjacent sequences: A145668 A145669 A145670 this_sequence A145672 A145673 A145674
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009
|
|
|
Search completed in 0.002 seconds
|
