login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290038 Number of set partitions of [n] having exactly nine blocks of size > 1. 3
34459425, 2618916300, 108030297375, 3211227869850, 77083218186975, 1588144599241200, 29158562820672285, 489227666491814250, 7636058324659014250, 112346788172994575200, 1573773827894456037850, 21155069633041246602700, 274588861338588612866050 (list; graph; refs; listen; history; text; internal format)
OFFSET

18,1

LINKS

Alois P. Heinz, Table of n, a(n) for n = 18..1000

Wikipedia, Partition of a set

FORMULA

E.g.f.: (exp(x)-x-1)^9/9!*exp(x).

a(0) = a(1) = 0, for n>1 a(n) = 10*a(n-1) + (n-1)*A290037(n-2). - Ray Chandler, Jul 21 2017

CROSSREFS

Column k=9 of A124324.

Cf. A290037.

Sequence in context: A172687 A332388 A271769 * A289957 A263893 A250573

Adjacent sequences:  A290035 A290036 A290037 * A290039 A290040 A290041

KEYWORD

nonn,easy

AUTHOR

Alois P. Heinz, Jul 18 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 22:42 EST 2021. Contains 349567 sequences. (Running on oeis4.)