|
Search: id:A097146
|
|
|
| A097146 |
|
Total sum of maximum list sizes in all sets of lists of n-set, cf. A000262. |
|
+0
3
|
|
| 1, 5, 31, 217, 1781, 16501, 172915, 1998641, 25468777, 352751941, 5292123431, 85297925065, 1472161501981, 27039872306357, 527253067633531, 10865963240550241
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
E.g.f.: exp(x/(1-x))*Sum_{k>0} (1-exp(x^k/(x-1))).
|
|
EXAMPLE
|
For n=4 we have 73 sets of lists (cf. A000262): (1234) (24 ways), (123)(4) (6*4 ways), (12)(34) (3*4 ways), (12)(3)(4) (6*2 ways), (1)(2)(3)(4) (1 way); so a(4)= 24*4+24*3+12*2+12*2+1*1 = 217.
|
|
CROSSREFS
|
Cf. A028417, A028418, A046746, A006128, A097145, A097147, A097148.
Sequence in context: A087457 A036758 A110379 this_sequence A059035 A058309 A001910
Adjacent sequences: A097143 A097144 A097145 this_sequence A097147 A097148 A097149
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 27 2004
|
|
|
Search completed in 0.002 seconds
|
