login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100759 Beginning with 2, least prime not occurring earlier such that the concatenation of first n terms has the least prime factor prime(n). 1

%I #7 Aug 26 2015 23:47:58

%S 2,7,5,17,127,3,347,37,71,829,89,79,311,271,1103,823,827,7219,149,499,

%T 3947,6367,2861,3673,13781,2281,281,229,353,1597,191,1879,2609,10993,

%U 19961,4789,383,1093,521,13681,9227,12619,8219,12037,8573,7621,6029

%N Beginning with 2, least prime not occurring earlier such that the concatenation of first n terms has the least prime factor prime(n).

%C Conjecture: Every prime is a member.

%e a(1) = 2, a(2) = 7 and the least prime divisor of 27 is 3.

%t a = {2}; b = 2; Do[i = 1; While[Length[Intersection[a, {Prime[i]}]] == 1, i++ ]; While[ !FactorInteger[FromDigits[Join[IntegerDigits[b], IntegerDigits[Prime[i]]]]][[1, 1]] == Prime[n], i++ ]; AppendTo[a, Prime[i]]; b = FromDigits[Join[IntegerDigits[b], IntegerDigits[Prime[i]]]], {n, 2, 30}]; a (* _Stefan Steinerberger_, Dec 21 2007 *)

%Y Cf. A114025.

%K base,less,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 23 2004

%E More terms from _Stefan Steinerberger_, Dec 21 2007

%E More terms from _David Wasserman_, Mar 04 2008

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 05:35 EDT 2024. Contains 371697 sequences. (Running on oeis4.)