The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

Revision History for A026826

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

A026826

Number of partitions of n into distinct parts, the least being 5.
(history; published version)

#23 by Michel Marcus at Wed Nov 25 03:11:39 EST 2020

STATUS

reviewed

approved

#22 by Joerg Arndt at Wed Nov 25 01:40:12 EST 2020

STATUS

proposed

reviewed

#21 by Michel Marcus at Tue Nov 24 23:34:42 EST 2020

STATUS

editing

proposed

#20 by Michel Marcus at Tue Nov 24 23:34:40 EST 2020

FORMULA

G.f.: x^5*Product_{j>=6..infinity} (1+x^j). - R. J. Mathar, Jul 31 2008

STATUS

proposed

editing

#19 by Ilya Gutkovskiy at Tue Nov 24 20:08:12 EST 2020

STATUS

editing

proposed

#18 by Ilya Gutkovskiy at Tue Nov 24 20:01:31 EST 2020

FORMULA

G.f.: Sum_{k>=1} x^(k*(k + 9)/2) / Product_{j=1..k-1} (1 - x^j). - Ilya Gutkovskiy, Nov 24 2020

STATUS

approved

editing

#17 by Susanna Cuyler at Sat Jun 13 22:08:13 EDT 2020

STATUS

proposed

approved

#16 by Wesley Ivan Hurt at Sat Jun 13 20:30:32 EDT 2020

STATUS

editing

proposed

#15 by Wesley Ivan Hurt at Sat Jun 13 20:30:13 EDT 2020

FORMULA

G.f.: x^5*product_Product_{j=6..infinity} (1+x^j). - R. J. Mathar, Jul 31 2008

CROSSREFS

Cf. A025147, A025151.

Cf. A025147.

STATUS

proposed

editing

#14 by Robert Price at Sat Jun 13 19:58:13 EDT 2020

STATUS

editing

proposed