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!)
A087259 a(n) = lcm(n, A025586(n)), least common multiple of n and largest value in 3x+1 iteration list started at n. 1

%I #11 Mar 15 2018 04:12:52

%S 1,2,48,4,80,48,364,8,468,80,572,48,520,364,480,16,884,468,1672,20,

%T 1344,572,3680,24,2200,520,249264,364,2552,480,286192,32,3300,884,

%U 1120,468,4144,1672,11856,40,378512,1344,8428,572,6120,3680,433904,48,7252,2200

%N a(n) = lcm(n, A025586(n)), least common multiple of n and largest value in 3x+1 iteration list started at n.

%H <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>

%t c[x_] := (1-Mod[x, 2])*(x/2)+Mod[x, 2]*(3*x+1)c[1]=1; fpl[x_] := Delete[FixedPointList[c, x], -1] Table[LCM[w, Max[fpl[w]]], {w, 1, 256}]

%Y Cf. A025586, A033496, A087261.

%K nonn

%O 1,2

%A _Labos Elemer_, Sep 09 2003

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 April 16 01:40 EDT 2024. Contains 371696 sequences. (Running on oeis4.)