|
Search: id:A097145
|
|
|
| A097145 |
|
Total sum of minimum list sizes in all sets of lists of n-set, cf. A000262. |
|
+0
4
|
|
| 1, 5, 25, 157, 1101, 9211, 85513, 900033, 10402633, 133059331, 1836961941, 27619253113, 444584808253, 7678546353843, 140944884572521, 2751833492404321, 56691826303303953, 1233793951629951043
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
E.g.f.: Sum_{k>0} (exp(x^k/(1-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(n)= 24*4+24*1+12*2+12*1+1*1 = 157.
|
|
CROSSREFS
|
Cf. A028417, A028418, A046746, A006128, A097146-A097148.
Sequence in context: A092166 A121112 A090014 this_sequence A085644 A137963 A144887
Adjacent sequences: A097142 A097143 A097144 this_sequence A097146 A097147 A097148
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 27 2004
|
|
EXTENSIONS
|
More terms from Max Alekseyev (maxale(AT)gmail.com), Jul 04 2009
|
|
|
Search completed in 0.002 seconds
|
