This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A326493 Sum of multinomials M(n-k; p_1-1, ..., p_k-1), where p = (p_1, ..., p_k) ranges over all partitions of n into distinct parts (k is a partition length). 3
 1, 1, 1, 2, 2, 5, 9, 21, 38, 146, 322, 902, 3106, 8406, 35865, 123321, 393691, 1442688, 7310744, 23471306, 129918661, 500183094, 2400722981, 9592382321, 47764284769, 280267554944, 1247781159201, 7620923955225, 36278364107926, 189688942325418, 1124492015730891 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..731 Wikipedia, Multinomial coefficients Wikipedia, Partition (number theory) MAPLE with(combinat): a:= n-> add(multinomial(n-nops(p), map(x-> x-1, p)[], 0),         p=select(l-> nops(l)=nops({l[]}), partition(n))): seq(a(n), n=0..30); # second Maple program: b:= proc(n, i, p) option remember; `if`(i*(i+1)/2 b(n\$3): seq(a(n), n=0..31); CROSSREFS Cf. A007837, A327711, A327712. Sequence in context: A052969 A002990 A060405 * A003228 A184713 A110182 Adjacent sequences:  A326490 A326491 A326492 * A326494 A326495 A326496 KEYWORD nonn AUTHOR Alois P. Heinz, Sep 22 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 20:12 EST 2019. Contains 329961 sequences. (Running on oeis4.)