login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145669 a(n) = smallest member of the n-th term in S(2) (defined in Comments). 1

%I

%S 2,5,11,13,17,37,41,67,73,107,127,131,149,173,191,193,211,223,233,239,

%T 241,251,257,263,277,281,337,349,353,373,419,431,443,491,509,521,541,

%U 547,557,613,653,661,683,701,709,719,733,761,769,787,853,877,907,1019,1031,1091,1093,1153,1163,1187,1193,1201,1259,1381,1433,1451,1453,1553,1597,1637,1657,1709,1721,1753,1759,1777,1783,1811,1889,1907,1931,1973,2027

%N a(n) = smallest member of the n-th term in S(2) (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, A104080, A014234.

%K nonn,base

%O 1,1

%A _W. Edwin Clark_, Mar 17 2009

%E More terms from _Max Alekseyev_, May 12 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 08:57 EDT 2019. Contains 326077 sequences. (Running on oeis4.)