|
| |
|
|
A145671
|
|
a(n) = number of components of the graph P(n,3) (defined in Comments).
|
|
0
| |
|
|
1, 2, 4, 8, 15, 32, 88, 209, 539, 1403, 3698, 9962, 26447, 71579, 196590, 541473, 1501720, 4186566, 11737617
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 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 * A108693 A007673 A026096
Adjacent sequences: A145668 A145669 A145670 * A145672 A145673 A145674
|
|
|
KEYWORD
| nonn,base,more
|
|
|
AUTHOR
| Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009
|
|
|
EXTENSIONS
| a(11)-a(19) from Max Alekseyev (maxale(AT)gmail.com), May 12 2011
|
| |
|
|
