cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A290035 Number of set partitions of [n] having exactly six blocks of size > 1.

Original entry on oeis.org

10395, 405405, 8828820, 142101960, 1889157270, 21997025050, 232434862660, 2281515816580, 21144158620585, 187205367167455, 1597460349645160, 13226705948208060, 106823347196076588, 845052099612035700, 6569883153685651800, 50334986592592563576
Offset: 12

Views

Author

Alois P. Heinz, Jul 18 2017

Keywords

Crossrefs

Column k=6 of A124324.
Cf. A290034.

Formula

E.g.f.: (exp(x)-x-1)^6/6!*exp(x).
G.f.: -(46416180096*x^15 -267702314880*x^14 +715470788032*x^13 -1174802003648*x^12 +1324630789300*x^11 -1085757157800*x^10 +667971384675*x^9 -313912715655*x^8 +113562125600*x^7 -31611210400*x^6 +6712800710*x^5 -1067591910*x^4 +123053700*x^3 -9702000*x^2 +467775*x -10395)*x^12 / ((7*x-1) *(6*x-1)^2 *(5*x-1)^3 *(4*x-1)^4 *(3*x-1)^5 *(2*x-1)^6 *(x-1)^7).
a(0) = a(1) = 0, for n>1 a(n) = 7*a(n-1) + (n-1)*A290034(n-2). - Ray Chandler, Jul 21 2017