login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A271766 Number of set partitions of [n] with minimal block length multiplicity equal to six. 2
1, 0, 0, 0, 0, 0, 10395, 0, 0, 0, 0, 0, 383563180, 523783260, 6547290750, 3055402350, 157964301495, 14054850810, 34828180582195, 91670862398500, 448593283888750, 11612610774464700, 7681370284312725, 6594450798260325, 179804372693675480751, 11896760875264765500 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,7

LINKS

Alois P. Heinz, Table of n, a(n) for n = 6..577

Wikipedia, Partition of a set

FORMULA

a(n) = A271424(n,6).

MAPLE

with(combinat):

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

      `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)

        *b(n-i*j, i-1, k)/j!, j={0, $k..n/i})))

    end:

a:= n-> b(n$2, 6)-b(n$2, 7):

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

CROSSREFS

Column k=6 of A271424.

Sequence in context: A180460 A035912 A226599 * A104439 A290035 A289954

Adjacent sequences:  A271763 A271764 A271765 * A271767 A271768 A271769

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Apr 13 2016

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 14 23:22 EST 2017. Contains 294693 sequences.