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!)
A285923 Number of ordered set partitions of [n] into eight blocks such that equal-sized blocks are ordered with increasing least elements. 3
1, 288, 18600, 649440, 18650346, 378728064, 6346968056, 99768480240, 1370094506209, 17452476893280, 204026690329800, 2291047776886752, 24663963563727574, 256637317406331648, 2540192740448641960, 24558666993552144288, 233835181800425532162 (list; graph; refs; listen; history; text; internal format)
OFFSET

8,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 8..700

Wikipedia, Partition of a set

MAPLE

b:= proc(n, i, p) option remember; series(`if`(n=0 or i=1,

      (p+n)!/n!*x^n, add(x^j*b(n-i*j, i-1, p+j)*combinat

      [multinomial](n, n-i*j, i$j)/j!^2, j=0..n/i)), x, 9)

    end:

a:= n-> coeff(b(n$2, 0), x, 8):

seq(a(n), n=8..30);

MATHEMATICA

multinomial[n_, k_List] := n!/Times @@ (k!);

b[n_, i_, p_] := b[n, i, p] = Series[If[n == 0 || i == 1, (p + n)!/n!*x^n, Sum[x^j*b[n - i*j, i - 1, p + j]*multinomial[n, Join[{n - i*j}, Table[i, j]]]/j!^2, {j, 0, n/i}]], {x, 0, 9}];

a[n_] := Coefficient[b[n, n, 0], x, 8];

Table[a[n], {n, 8, 30}] (* Jean-Fran├žois Alcover, May 17 2018, translated from Maple *)

CROSSREFS

Column k=8 of A285824.

Cf. A285859.

Sequence in context: A035749 A048145 A022154 * A285859 A163007 A268873

Adjacent sequences:  A285920 A285921 A285922 * A285924 A285925 A285926

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Apr 28 2017

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 October 1 04:31 EDT 2022. Contains 357134 sequences. (Running on oeis4.)