OFFSET
1,2
COMMENTS
Given a power of two, the value in this sequence is the next higher Mersenne number, or a(2^m) = 2^(m + 1) - 1. - Alonso del Arte, Apr 10 2009
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Collatz Problem
Wikipedia, Collatz conjecture
EXAMPLE
a(5) = 36 because the Ulam's conjecture trajectory sequence starting on 5 runs 5, 16, 8, 4, 2, 1 and therefore 5 + 16 + 8 + 4 + 2 + 1 = 36. - Alonso del Arte, Apr 10 2009
MAPLE
a:= proc(n) option remember; n+`if`(n=1, 0,
a(`if`(n::even, n/2, 3*n+1)))
end:
seq(a(n), n=1..55); # Alois P. Heinz, Jan 29 2021
MATHEMATICA
collatz[1] = 1; collatz[n_Integer?OddQ] := 3n + 1; collatz[n_Integer?EvenQ] := n/2; Table[-1 + Plus @@ FixedPointList[collatz, n], {n, 60}] (* Alonso del Arte, Apr 10 2009 *)
PROG
(Haskell)
a033493 = sum . a070165_row -- Reinhard Zumkeller, Oct 08 2011
(Python)
def a(n):
if n==1: return 1
l=[n, ]
while True:
if n%2==0: n//=2
else: n = 3*n + 1
l+=[n, ]
if n<2: break
return sum(l)
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Apr 14 2017
CROSSREFS
KEYWORD
nonn,look
AUTHOR
EXTENSIONS
Corrected a(16) to 31 to match other powers of 2; removed duplicate value of a(48) = 139 because a(49) = 806 and not 139. - Alonso del Arte, Apr 10 2009
STATUS
approved