|
%I #5 Mar 31 2012 20:01:59
%S 2,5,7,17,13,19,23,53,31,43,41,59,79,67,71,137,151,157,127,131,149,
%T 181,167,233,197,211,199,241,229,239,479,419,457,449,283,293,313,349,
%U 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
%N a(n) = largest member of the n-th term in S(3) (defined in Comments).
%C 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.
%Y Cf. A145667-A145674.
%K nonn,base
%O 1,1
%A _W. Edwin Clark_, Mar 17 2009
%E More terms from _Max Alekseyev_, May 12 2011
|
