|
%I #5 Mar 31 2012 20:01:59
%S 2,3,7,11,13,19,23,29,31,37,41,59,61,67,71,83,97,103,109,113,149,163,
%T 167,173,191,193,199,223,229,239,251,257,271,281,283,293,307,331,337,
%U 347,353,367,373,379,389,409,421,487,491,499,503,521,523,569,571,577,599,601,607,643,659,691,733,739,743,757,761,769,773
%N a(n) = smallest 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
|
