OFFSET
1,1
COMMENTS
From Michael S. Branicky, Jan 02 2026: (Start)
Terms must be increasing. If not unique, then 2, 3, 5, 7, 2, 3, 5, 7, 2, 3, ... works. If unique, but not increasing, then sequence starts 2, 3, 5, 7, 11, 23, 59, 47, 61, 83, ... .
a(4004) has 1001 digits. (End)
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..4003
Michael S. Branicky, Python program for OEIS A107367
MATHEMATICA
d=2; e=3; f=5; b={2, 3, 5}; id[t_]:=IntegerDigits[t]; Do[p=Prime[n]; If[Intersection[Union[id[d], id[e], id[f]], id[p]]=={}, b=Append[b, p]; d=e; e=f; f=p], {n, 100000}]; b
nxt[{a_, b_, c_}]:=Module[{dgs=Union[Flatten[IntegerDigits/@{a, b, c}]], d = NextPrime[ c]}, While[ Intersection[dgs, IntegerDigits[d]]!={}, d= NextPrime[d]]; {b, c, d}]; NestList[nxt, {2, 3, 5}, 30][[All, 1]] (* Harvey P. Dale, Oct 11 2021 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Zak Seidov, May 24 2005
EXTENSIONS
More terms from Harvey P. Dale, Oct 11 2021
a(32) onward from Michael S. Branicky, Jan 01 2026
STATUS
approved
