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!)
A242057 Even numbers n for which lpf_3(n-1) < lpf_3(n-3), 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. 6

%I #19 Aug 20 2014 02:34:39

%S 10,16,22,26,28,34,36,40,46,50,56,64,66,70,76,82,86,92,96,100,106,112,

%T 116,120,126,130,134,136,142,144,146,154,156,160,162,166,170,176,184,

%U 186,190,196,202,204,206,210,214,216,222,226,232,236,244,254,256,260

%N Even numbers n for which lpf_3(n-1) < lpf_3(n-3), 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.

%C An analog of A245024.

%H Jens Kruse Andersen, <a href="/A242057/b242057.txt">Table of n, a(n) for n = 1..10000</a>

%t lpf[n_]:=lpf[n]=First[First[FactorInteger[n]]];

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

%t Select[Range[4,300,2],lpf3[#-1]<lpf3[#-3]&](* _Peter J. C. Moses_, Aug 13 2014 *)

%o (PARI) lpf3(n)=m=n/3^valuation(n, 3); if(m>1, factor(m)[1,1], 1)

%o select(n->lpf3(n-1)<lpf3(n-3), vector(200, x, 2*x)) \\ _Jens Kruse Andersen_, Aug 19 2014

%Y Cf. A245024, A243937, A020639.

%K nonn

%O 1,1

%A _Vladimir Shevelev_, Aug 13 2014

%E More terms from _Peter J. C. Moses_, Aug 13 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 March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)