

A145672


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


1



1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 1, 3, 1, 1, 5, 2, 3, 2, 2, 1, 2, 1, 4, 2, 2, 1, 2, 1, 1, 8, 3, 5, 3, 1, 1, 2, 2, 1, 3, 2, 1, 1, 2, 1, 2, 1, 6, 4, 2, 3, 4, 1, 5, 1, 2, 2, 3, 1, 1, 1, 1, 9, 1, 4, 5, 1, 1, 2, 11, 6, 6, 2, 3, 1, 1, 4, 1, 1, 1, 3, 4, 1, 6, 2, 1, 4, 1, 2, 1, 4, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 7, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


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..109.


CROSSREFS

Cf. A145667A145674.
Sequence in context: A104639 A260704 A161223 * A175024 A175023 A128115
Adjacent sequences: A145669 A145670 A145671 * A145673 A145674 A145675


KEYWORD

nonn,base


AUTHOR

W. Edwin Clark, Mar 17 2009


EXTENSIONS

More terms from Max Alekseyev, May 12 2011


STATUS

approved



