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.

A169588 The total number of ways of partitioning the multiset {1,1,1,1,2,3,...,n-3}.

Original entry on oeis.org

5, 12, 38, 141, 592, 2752, 13960, 76464, 448603, 2801054, 18516832, 129034659, 944356507, 7235605732, 57879020756, 482189616711, 4174720731316, 37489711726834, 348592657600818, 3350919079643612, 33252861484374737, 340209759518479300, 3584240435109146792
Offset: 4

Views

Author

Martin Griffiths, Dec 02 2009

Keywords

Crossrefs

This is related to A000110, A035098 and A169587.
Row n=4 of A346426.
Cf. A346814.

Programs

  • Mathematica
    Table[(BellB[n] + 6 BellB[n - 1] + 17 BellB[n - 2] + 20 BellB[n - 3] + 21 BellB[n - 4])/24, {n, 4, 23}]

Formula

For n>=4, a(n)=(Bell(n)+6Bell(n-1)+17Bell(n-2)+20Bell(n-3)+21Bell(n-4))/24, where Bell(n) is the n-th Bell number (the Bell numbers are given in A000110). e.g.f. (e^(4x)+12e^(3x)+42e^(2x)+44e^x+21)(e^(e^x-1))/24.