%I A145667
%S A145667 0,1,1,2,1,2,4,11,13,19,29,43,107,169,350,603,1134
%N A145667 a(n) = number of components of the graph P(n,2) (defined in Comments).
%C A145667 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).
%Y A145667 Cf. A145667-A145674, A104080, A014234.
%Y A145667 Sequence in context: A063894 A024500 A000087 this_sequence A095067 A032259 
               A109851
%Y A145667 Adjacent sequences: A145664 A145665 A145666 this_sequence A145668 A145669 
               A145670
%K A145667 nonn,base,more
%O A145667 1,4
%A A145667 Edwin Clark (eclark(AT)math.usf.edu), Mar 17 2009