RosettaCodeData/Task/Hailstone-sequence/Ursa/hailstone-sequence.ursa
2023-07-01 13:44:08 -04:00

15 lines
225 B
Text

import "math"
def hailstone (int n)
decl int<> seq
while (> n 1)
append n seq
if (= (mod n 2) 0)
set n (floor (/ n 2))
else
set n (int (+ (* 3 n) 1))
end if
end while
append n seq
return seq
end hailstone