A158577 a(n) = size of the n-th term in S(10) (defined in Comments).

4, 21, 143, 1061, 8363, 68900, 1, 1, 1, 1, 1, 1, 586044, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

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

Links

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

Crossrefs

Cf. A006879, A158576, A158578, A158579 (base 10).

Cf. A145667, A145668, A145669, A145670 (base 2).

Cf. A145671, A145672, A145673, A145674 (base 3).

Sequence in context: A245503 A120368 A053482 * A006879 A228063 A228111

Adjacent sequences: A158574 A158575 A158576 * A158578 A158579 A158580

Keyword

base,hard,more,nonn

Author

W. Edwin Clark, Mar 21 2009

Status

approved