|
| |
|
|
A145670
|
|
a(n) = largest member of the n-th term in S(2) (defined in Comments).
|
|
0
| |
|
|
3, 7, 11, 13, 31, 61, 59, 113, 89, 107, 127, 227, 181, 173, 191, 229, 211, 223, 233, 239, 241, 251, 257, 479, 277, 503, 337, 349, 353, 373, 419, 431, 443, 491, 509, 619, 1021, 953, 557, 613, 653, 661, 683, 701, 709, 751, 733, 761, 773, 787, 853, 877, 971, 1019, 2029, 1123, 1879, 1409, 1163, 1699, 1193, 1201, 1259, 1381, 1433, 1451, 1453, 1553, 1597, 1637, 1913, 1709, 1979, 1753, 1759, 1777, 2039, 1811, 2017, 1907, 1931, 1973, 2027
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| 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, A104080, A014234.
Sequence in context: A164568 A053728 A059055 * A004061 A000572 A059568
Adjacent sequences: A145667 A145668 A145669 * A145671 A145672 A145673
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009
|
|
|
EXTENSIONS
| More terms from Max Alekseyev (maxale(AT)gmail.com), May 12 2011
|
| |
|
|
