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!)
A242065 Smallest k such that the union of {A242059(i): 1 <= i <= k} and {A242060(i): 1 <= i <= k} includes all primes {5, ..., prime(n)}. 2

%I #12 Aug 21 2014 23:08:23

%S 2,3,4,8,8,17,17,17,60,60,60,60,60,60,60,60,60,60,179,179,179,179,179,

%T 179,179,179,264,264,264,319,319,319,319,365,1112,1112,1112,1112,1112,

%U 1112,1112,1112,1112,1112,1112,4372,4372,4372,4372,4372,15504,15504

%N Smallest k such that the union of {A242059(i): 1 <= i <= k} and {A242060(i): 1 <= i <= k} includes all primes {5, ..., prime(n)}.

%t lpf[n_]:=lpf[n]=First[First[FactorInteger[n]]];(*least prime factor*)

%t lpf3[n_]:=lpf3[n]=If[#==1,1,lpf[#]]&[n/3^IntegerExponent[n,3]];

%t A242059=Map[lpf3[#-1]&,Select[Range[4,100000,2],lpf3[#-1]<lpf3[#-3]&](*A242057*)];

%t A242060=Map[lpf3[#-3]&,Select[Range[4,100000,2],lpf3[#-1]>lpf3[#-3]&](*A242058*)];

%t pos={};NestWhile[#+1&,3,(AppendTo[pos,Min[Position[A242059,Prime[#],1,1],Position[A242060,Prime[#],1,1]/.{}->0]];!Last[pos]==0)&];

%t A242065=Rest[FoldList[Max,-Infinity,Flatten[pos]]] (* _Peter J. C. Moses_, Aug 14 2014 *)

%Y Cf. A242033, A242034, A242036, A242037, A242057, A242058, A242059, A242060, A242064.

%K nonn

%O 3,1

%A _Vladimir Shevelev_, Aug 13 2014

%E More terms from _Peter J. C. Moses_, Aug 14 2014

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 May 8 17:57 EDT 2024. Contains 372340 sequences. (Running on oeis4.)