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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145520 Triangle read by rows: T2[n,k] = Sum_{partitions of n with k parts p(n, k; m_1, m_2, m_3, ..., m_n)} c(n; m_1, m_2, ..., m_n) * x_1^m_1 * x_2^m_2 * ... x^n*m_n, where x_i = i-th prime. 1
2, 3, 4, 5, 18, 8, 7, 67, 72, 16, 11, 220, 470, 240, 32, 13, 697, 2625, 2420, 720, 64, 17, 2100, 13559, 20230, 10360, 2016, 128, 19, 6159, 66374, 152313, 120400, 39200, 5376, 256, 23, 17340, 313136, 1071168, 1235346, 602784, 135744, 13824, 512, 29, 47581 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Here c(n; m_1, m_2, ..., m_n) = n! / (m_1!*1!^m_1 * m_2!*2!^m_2 * ... * m_n!*n!^m_n) is the number of ways to realize the partition p(n, k; m_1, m_2, m_3, ..., m_n).

LINKS

Tilman Neumann, More terms, partitions generator and transform implementation

CROSSREFS

Cf. A000040, A007446 (row sums), A145518

Sequence in context: A117885 A030574 A162657 * A061412 A165646 A024635

Adjacent sequences:  A145517 A145518 A145519 * A145521 A145522 A145523

KEYWORD

nonn,tabl

AUTHOR

Tilman Neumann (Tilman.Neumann(AT)web.de), Oct 12 2008, Oct 13 2008, Sep 02 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 12 18:02 EST 2012. Contains 205432 sequences.