The Collatz hypothesis

collatz.hs

kolc::Integer -> Integer
kolc n | even n = toInteger n `div` 2
kolc n | not $ even n = (n*3)+1


gks'::[Integer] -> [Integer]
gks' xs = xs ++ [kolc $ last xs]

gks::[Integer] -> [Integer]
gks xs | (last xs) == 1 = xs
gks xs = gks $ gks' xs

--pass any number
main = print $ gks [5]

collatz.py

def is_even(number):
    return number % 2 == 0

def kolc(number):
    print(int(number))#it can be float,but something like x.0
    if number == 1:
        return number

    if is_even(number):
        n = number/2
        kolc(n)
    else:
        n=(number*3)+1
        kolc(n)

#pass any number here
n = kolc(666)