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!)
A220139 The highest value of the Collatz iteration (3x+1) starting at a(n-1) + 1, with a(1) = 1. 3

%I #5 Jan 02 2013 18:49:24

%S 1,2,16,52,160,9232,27700,83104,599056,1797172,5391520,38862808,

%T 131161984,393485956,1180457872,3541373620,10624120864,87327950740,

%U 261983852224,785951556676,2357854670032,7553654536192,22660963608580,67982890825744,203948672477236

%N The highest value of the Collatz iteration (3x+1) starting at a(n-1) + 1, with a(1) = 1.

%C The length of the trajectory of a(n) is A220140(n).

%H T. D. Noe, <a href="/A220139/b220139.txt">Table of n, a(n) for n = 1..500</a>

%e The Collatz trajectory of 2 + 1 is (3, 10, 5, 16, 8, 4, 2, 1). Hence, a(3) = 16. The trajectory of 16 + 1 is (17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1). Hence, a(4) = 52.

%t Collatz[n_] := NestWhileList[If[EvenQ[#], #/2, 3 # + 1] &, n, # > 1 &]; c = {1}; t = {}; Do[AppendTo[t, Max[c]]; c = Collatz[t[[-1]] + 1], {30}]; t

%Y Cf. A070165 (trajectory of n).

%K nonn

%O 1,2

%A _T. D. Noe_, Jan 02 2013

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 17 20:17 EDT 2024. Contains 371767 sequences. (Running on oeis4.)