The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A002569

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A002569

Max_{k=0..n} { Number of partitions of n into exactly k parts }.
(history; published version)

#68 by N. J. A. Sloane at Sun Oct 22 22:08:25 EDT 2017

STATUS

editing

approved

#67 by N. J. A. Sloane at Sun Oct 22 22:08:23 EDT 2017

LINKS

Robert Israel and Robert G. Wilson v, , <a href="/A002569/b002569.txt">Table of n, a(n) for n = 0..3000</a> (n = 0..97 from Robert G. Wilson v)

STATUS

approved

editing

#66 by N. J. A. Sloane at Tue Jun 06 17:01:33 EDT 2017

STATUS

proposed

approved

#65 by Rachel Barnett at Tue Jun 06 16:50:25 EDT 2017

STATUS

editing

proposed

#64 by Rachel Barnett at Tue Jun 06 16:50:21 EDT 2017

LINKS

Victor Meally, <a href="/A002868/a002868.pdf">Comparison of several sequences given in Motzkin's paper "Sorting numbers for cylinders...", letter to N. J. A. Sloane, N. D.</a>

STATUS

approved

editing

#63 by Peter Luschny at Fri Nov 18 00:30:12 EST 2016

STATUS

proposed

approved

#62 by Vladimir Reshetnikov at Thu Nov 17 20:53:17 EST 2016

STATUS

editing

proposed

#61 by Vladimir Reshetnikov at Thu Nov 17 20:53:00 EST 2016

MATHEMATICA

Max[CoefficientList[#, a]] & /@ (1/QPochhammer[a q, q] + O[q]^60)[[3]] (* Vladimir Reshetnikov, Nov 17 2016 *)

STATUS

approved

editing

#60 by Danny Rorabaugh at Fri Oct 30 22:45:14 EDT 2015

STATUS

editing

approved

#59 by Danny Rorabaugh at Fri Oct 30 22:44:37 EDT 2015

COMMENTS

Motzkin denotes a(n) by $!\max_>^{!n}$. - Danny Rorabaugh, Oct 13 2015

LINKS

OEIS Wiki, <a href="http://oeis.org/wiki/Sorting_numbers">Sorting numbers</a>

STATUS

approved

editing