F(n) = F(n-1) + F(n-3)

 

数学归纳法：

F(1) = 1, F(2) = 2, F(3) = 3 

F(n) = F(n-1)  + F(n-3)

def permutation(n):
    if n >= 1 and n <= 3:
        return n

    return permutation(n-1) + permutation(n-3)


if __name__ == '__main__':
    print(permutation(6))