login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132963 Total number of distinct block sizes in all partitions of [n]. 7

%I #14 Jan 06 2022 17:44:40

%S 1,2,8,25,102,439,2067,10406,56754,328257,2015818,13067366,89192170,

%T 638321285,4779442602,37332643831,303635437532,2565592977205,

%U 22483754207839,204013083946460,1913880812797792,18536832515581167,185130415180288134,1904280138346826637

%N Total number of distinct block sizes in all partitions of [n].

%H G. C. Greubel, <a href="/A132963/b132963.txt">Table of n, a(n) for n = 1..500</a>

%F E.g.f.: exp(exp(x)-1)*Sum_{k>0} (1-exp(-x^k/k!)).

%p b:= proc(n, i, c) option remember; `if`(n=0, c,

%p `if`(i<1, 0, add(b(n-j*i, i-1, c+signum(j))*

%p combinat[multinomial](n, n-i*j, i$j)/j!, j=0..n/i)))

%p end:

%p a:= n-> b(n$2, 0):

%p seq(a(n), n=1..30); # _Alois P. Heinz_, Jan 06 2022

%t Rest[ Range[0, 23]! CoefficientList[ Series[ Exp[ Exp[x] - 1] Sum[1 - Exp[ -x^k/k! ], {k, 30}], {x, 0, 23}], x]] (* _Robert G. Wilson v_, Sep 13 2007 *)

%Y Cf. A005493, A132958, A132959, A132960, A132961, A132962, A350175.

%K easy,nonn

%O 1,2

%A _Vladeta Jovovic_, Sep 06 2007

%E More terms from _Robert G. Wilson v_, Sep 13 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 28 19:04 EDT 2024. Contains 375508 sequences. (Running on oeis4.)