The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158578 a(n) = smallest member of the n-th term in S(10) (defined in Comments). 2
 2, 11, 101, 1009, 10007, 100003, 1000003, 294001, 505447, 584141, 604171, 929573, 971767, 10000019, 1062599, 1282529, 1524181, 2017963, 2474431, 2690201, 3070663, 3085553, 3326489, 4393139, 5152507, 5285767, 5564453, 5575259 (list; graph; refs; listen; history; text; internal format)
 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 CROSSREFS Sequence in context: A254320 A115062 A062397 * A003617 A114018 A089770 Adjacent sequences:  A158575 A158576 A158577 * A158579 A158580 A158581 KEYWORD base,hard,nonn AUTHOR W. Edwin Clark, Mar 21 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 06:25 EDT 2020. Contains 336422 sequences. (Running on oeis4.)