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!)
A242066 The smallest even k such that lpf_3(k-3) > lpf_3(k-1) >= p_n, where lpf_3(n) = lpf(n/3^t) (cf. A020639) such that 3^t (t>=0) is the maximal power of 3 which divides n. 0
16, 22, 34, 40, 70, 70, 70, 112, 112, 112, 130, 130, 142, 160, 184, 184, 202, 214, 310, 310, 310, 310, 310, 310, 310, 340, 340, 340, 382, 412, 412, 490, 490, 490, 490, 490, 502, 544, 544, 544, 574, 580, 634, 634, 634, 754, 754, 754, 754, 754, 754, 754, 772 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
COMMENTS
a(n)-3 and (a(n)-1)/3 are primes.
LINKS
MATHEMATICA
lpf[n_]:=lpf[n]=First[First[FactorInteger[n]]]; (*least prime factor*)
lpf3[n_]:=lpf3[n]=If[#==1, 1, lpf[#]]&[n/3^IntegerExponent[n, 3]];
Table[NestWhile[#+2&, 2, !(lpf3[#-3]>lpf3[#-1]>=Prime[n])&], {n, 3, 100}] (* Peter J. C. Moses, Aug 14 2014 *)
CROSSREFS
Sequence in context: A059756 A242214 A242559 * A303958 A304601 A165338
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Aug 13 2014
STATUS
approved

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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)