OFFSET
0,1
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, E16.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (0,0,1).
MAPLE
f := proc(n) option remember; if n = 0 then 51; elif f(n-1) mod 2 = 0 then f(n-1)/2 else 3*f(n-1)+1; fi; end;
MATHEMATICA
NestList[If[EvenQ[#], #/2, 3# + 1]&, 51, 100] (* Vincenzo Librandi, Jul 29 2014 *)
PROG
(Magma) [n eq 1 select 51 else IsOdd(Self(n-1)) select 3*Self(n-1)+1 else Self(n-1) div 2: n in [1..80]]; // Vincenzo Librandi, Jul 29 2014
(PARI) Collatz(n, lim=0)={
my(c=n, e=0, L=List(n)); if(lim==0, e=1; lim=n*10^6);
for(i=1, lim, if(c%2==0, c=c/2, c=3*c+1); listput(L, c); if(e&&c==1, break));
return(Vec(L)); }
print(Collatz(51, 60)) \\ A008883 (from 51 first 60)
\\ Anatoly E. Voevudko, Mar 26 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved