|
Search: id:A101052
|
|
|
| A101052 |
|
Number of preferential arrangements of n labeled elements when only k<=3 ranks are allowed. |
|
+0 1
|
|
| 1, 1, 3, 13, 51, 181, 603, 1933, 6051, 18661, 57003, 173053, 523251, 1577941, 4750203, 14283373, 42915651, 128878021, 386896203, 1161212893, 3484687251, 10456158901, 31372671003, 94126401613, 282395982051, 847221500581
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The (labeled) case for k<=2 is given by A000225. The unlabeled analogue for k<=2 is given by A028310 (A000027). The unlabeled analogue for k<=3 is given by A000124.
Alice and Bob went out for dinner; Alice paid 10 euro for the taxi, Bob paid 20 euro for the dinner; if they have to equally divide the expenses Alice will have to give 5 euro to Bob. With two people, Alice and Bob, there are three possible cases: Alice has to give money to Bob, Bob has to give money to Alice, they paid the same amount, so no debtors nor creditors. With three people, there are 13 cases, with four people there are 51 cases and so on. - Alessandro Gentilini (alessandro.gentilini(AT)gmail.com), Aug 10 2006
|
|
LINKS
|
Thomas Wieder, Home Page.
Thomas Wieder, (Old) Home Page.
|
|
FORMULA
|
egf = 2*exp(z)-2*exp(z)^2+exp(z)^3; ogf = -(-1+3*z-6*z^2)/(11*z^2+1-6*z-6*z^3). a(n) = 3^n+2-2*2^n; recurrence: a(n+3)-6*a(n+2)+11*a(n+1)-6*a(n), a(0) = 1, a(1) = 1, a(2) = 3.
|
|
MAPLE
|
A101052 := n -> 3^n+2-2*2^n; [ seq(3^n+2-2*2^n, n=0..30) ];
|
|
CROSSREFS
|
Cf. A000670, A000225, A000124, A028310, A097237.
Sequence in context: A116427 A008827 A026529 this_sequence A016064 A163774 A014985
Adjacent sequences: A101049 A101050 A101051 this_sequence A101053 A101054 A101055
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Thomas Wieder (wieder.thomas(AT)t-online.de), Nov 28 2004
|
|
|
Search completed in 0.002 seconds
|