

A145674


a(n) = largest member of the nth term in S(3) (defined in Comments).


12



2, 5, 7, 17, 13, 19, 23, 53, 31, 43, 41, 59, 79, 67, 71, 137, 151, 157, 127, 131, 149, 181, 167, 233, 197, 211, 199, 241, 229, 239, 479, 419, 457, 449, 283, 293, 313, 349, 337, 401, 359, 367, 373, 397, 389, 463, 421, 727, 653, 661, 719, 701, 523, 647, 571, 631, 617, 619, 607, 643, 659, 691, 1453, 739, 1283, 1429, 761, 769
(list;
graph;
refs;
listen;
history;
text;
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,...,b1} 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.


LINKS

Table of n, a(n) for n=1..68.


CROSSREFS

Cf. A145667A145674.
Sequence in context: A208241 A089727 A113514 * A067161 A281794 A193462
Adjacent sequences: A145671 A145672 A145673 * A145675 A145676 A145677


KEYWORD

nonn,base


AUTHOR

W. Edwin Clark, Mar 17 2009


EXTENSIONS

More terms from Max Alekseyev, May 12 2011


STATUS

approved



