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!)
A341283 Number of ways to partition n labeled elements into sets of different sizes of at least 3. 3
1, 0, 0, 1, 1, 1, 1, 36, 57, 211, 331, 958, 29228, 64065, 294659, 1232479, 3549717, 11296603, 557617987, 1512758550, 8514685860, 41183585167, 251022906729, 838303110637, 4183056225010, 263978773601641, 887708421995331, 5813843897797861, 32212405278588967, 216518890998518716 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
E.g.f.: Product_{k>=3} (1 + x^k/k!).
MAPLE
b:= proc(n, i) option remember; `if`(n=0, 1,
`if`(i>n, 0, b(n, i+1)+b(n-i, i+1)*binomial(n, i)))
end:
a:= n-> b(n, 3):
seq(a(n), n=0..30); # Alois P. Heinz, Apr 28 2021
MATHEMATICA
nmax = 29; CoefficientList[Series[Product[(1 + x^k/k!), {k, 3, nmax}], {x, 0, nmax}], x] Range[0, nmax]!
a[0] = 1; a[n_] := a[n] = -(n - 1)! Sum[DivisorSum[k, # (-#!)^(-k/#) &, # > 2 &] a[n - k]/(n - k)!, {k, 1, n}]; Table[a[n], {n, 0, 29}]
CROSSREFS
Sequence in context: A116321 A187989 A080469 * A260138 A260131 A320632
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Apr 28 2021
STATUS
approved

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 July 24 09:48 EDT 2024. Contains 374583 sequences. (Running on oeis4.)