|
Search: id:A047992
|
|
|
| A047992 |
|
Number of distinct permutations generated by shuffling n cards with "clump size" <= 2. |
|
+0
4
|
|
| 2, 5, 10, 16, 26, 42, 68, 110, 178, 288, 466, 754, 1220, 1974, 3194
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
Take a deck of n cards, cut into two non-empty piles, then do a riffle-shuffle in which no more than 2 consecutive cards fall from the same half. Sequence gives number of distinct n-permutations that result.
|
|
FORMULA
|
For n>3, a(n) = 2 * F(n+1), with F(n) = A000045(n).
|
|
EXAMPLE
|
a(4)=10 because we can split the deck as 1|234 then shuffle to get 2134 or 2314, or split as 12|34 and get 3421 1324 1342 3124 3142 or split 123|4 and get 1243, 1423. These plus the identity (1234) give 10 permutations in all.
|
|
CROSSREFS
|
Essentially the same as A006355.
Sequence in context: A011903 A078435 A049815 this_sequence A079984 A027613 A067112
Adjacent sequences: A047989 A047990 A047991 this_sequence A047993 A047994 A047995
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Mike Keith (domnei(AT)aol.com)
|
|
|
Search completed in 0.005 seconds
|
