|
%I #18 May 11 2023 12:47:29
%S 2,3,9,11,13,63,51,29,69,33,49,159,17,37,39,117,53,43,47,31,23,97,171,
%T 89,367,347,157,83,447,19,249,153,233,163,141,317,471,391,107,93,261,
%U 339,183,87,403,129,81,173,411,57,177,109,71,121,269,609,111,1413,99,21
%N Beginning with 2, least number not occurring earlier such that every partial concatenation is prime.
%C Conjecture: every odd number not divisible by 5 is a member.
%H Michael S. Branicky, <a href="/A110772/b110772.txt">Table of n, a(n) for n = 1..1078</a>
%e 2, 23, 239, 23911, 2391113, ... etc. are all prime.
%p L:=[2]: for n from 1 to 120 do for m from 1 do if isprime(parse(cat("",op(L),m))) and not member(m,L) then L:=[op(L),m]; break fi od od: L[]; # Alec Mihailovs, Aug 14 2005
%t a[1]=2;a[n_]:=a[n]=Block[{t=1},While[!PrimeQ[FromDigits@Flatten[IntegerDigits/@Join[Array[a,n-1],{t}]]]||MemberQ[Array[a,n-1],t],t++];t];Array[a,60] (* _Giorgos Kalogeropoulos_, May 07 2023 *)
%o (Python)
%o from gmpy2 import is_prime
%o from itertools import count, islice
%o def agen(): # generator of terms
%o an, s, aset, mink = 2, "2", {2}, 3
%o while True:
%o yield an
%o an = next(k for k in count(mink, 2) if k not in aset and is_prime(int(s+str(k))))
%o s += str(an)
%o aset.add(an)
%o while mink in aset: mink += 2
%o print(list(islice(agen(), 60))) # _Michael S. Branicky_, May 11 2023
%Y Cf. A089564, A110773.
%K easy,nonn,base
%O 1,1
%A _Amarnath Murthy_, Aug 12 2005
%E More terms from Alec Mihailovs (alec(AT)mihailovs.com), Aug 14 2005
%E Edited by _Charles R Greathouse IV_, Apr 27 2010
|
