|
Search: id:A145667
|
|
|
| A145667 |
|
a(n) = number of components of the graph P(n,2) (defined in Comments). |
|
+0
13
|
|
| 0, 1, 1, 2, 1, 2, 4, 11, 13, 19, 29, 43, 107, 169, 350, 603, 1134
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
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, A104080, A014234.
Sequence in context: A063894 A024500 A000087 this_sequence A095067 A032259 A109851
Adjacent sequences: A145664 A145665 A145666 this_sequence A145668 A145669 A145670
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009
|
|
|
Search completed in 0.002 seconds
|
