A permutation of the integers 1 to n contains a sub-permutation if there exists a k less than n such that the first k numbers form a permutation of the integers 1 to k. Find the number of permutations of 1 to n which do not contain a sub-permutation.
If the solution is SP(n), post the value of SP(17).
Eg: SP(1)=1, SP(2)=1, SP(3)=3, SP(4)=14, SP(5)=80.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment