Arranging cards so that no two consecutive values remain consecutive Let us say we have 52 cards with values ranging from 1-13 (4 sets of cards from 1-13). Assume that you wanted no two consecutive values to be next to each other in the pile of cards. For example, a 3 cannot be next to a 2 or a 4. 
How many ways can I arrange these cards that there are no consecutive values next to each other? 

Can someone suggest a permutation that fulfills these requirements or suggest a computer program to solve the problem?
total ways are 52!. now let us assume we have two cards consecutive . consider them as a single group we can have 104 ways . they can be arranged in 2! ways between themselves.We have 1 set of 13 so number of ways of 1 pair of two consecutive cards is 2!.11! such arrangements in 104 ways can be done and of four different sets and these four sets can be arranged in 4! ways.  The total ways that cards are not together =52!-(2!.11!.4!.104.4)
total ways are 52!. now let us assume we have two cards consecutive . consider them as a single group we can have 104 ways . they can be arranged in 2! ways between themselves.We have 1 set of 13 so number of ways of 1 pair of two consecutive cards is 2!.11! such arrangements in 104 ways can be done and of four different sets and these four sets can be arranged in 4! ways.  The total ways that cards are not together =52!-(2!.11!.4!.104.4)