The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A261555

Triangle read by rows: T(n,k) is number of partitions of n having at least k distinct parts (n >= 1, k >= 1).
(history; published version)

#39 by Jon E. Schoenfield at Sat Apr 01 21:10:48 EDT 2017

STATUS

editing

approved

#38 by Jon E. Schoenfield at Sat Apr 01 21:10:45 EDT 2017

NAME

Triangle read by rows: T(n,k) is number of partitions of n having at least k distinct parts (n >= 1, k >= 1).

COMMENTS

[0, 0] together with the column 2 gives A144300. - Omar E. Pol, Sep 17 2016

STATUS

approved

editing

#37 by Michael Somos at Tue Sep 27 21:13:22 EDT 2016

STATUS

proposed

approved

#36 by Omar E. Pol at Tue Sep 27 13:49:11 EDT 2016

STATUS

editing

proposed

#35 by Omar E. Pol at Tue Sep 27 13:49:07 EDT 2016

EXAMPLE

3, 1;

5, 2;

7, 5;

11, 7, 1;

STATUS

proposed

editing

#34 by Omar E. Pol at Wed Sep 21 11:53:41 EDT 2016

STATUS

editing

proposed

#33 by Omar E. Pol at Wed Sep 21 11:53:28 EDT 2016

CROSSREFS

Cf. A000005, A000041, A000070, A000217, A003056, A060177, A090794, A116608, A144300.

STATUS

proposed

editing

Discussion

Wed Sep 21

11:53

Omar E. Pol: Added seven xrefs.

#32 by Omar E. Pol at Wed Sep 21 11:50:14 EDT 2016

STATUS

editing

proposed

#31 by Omar E. Pol at Wed Sep 21 11:49:41 EDT 2016

COMMENTS

Column 1 is A000041, n >= 1.

Conjecture: alternating Alternating row sums give A090794. (End)

Column 1 is A000041, n >= 1. (End)

Conjecture: [0, 0] together with the column 2 gives A144300. - Omar E. Pol, Sep 17 2016

FORMULA

Conjecture: T(n,1) - T(n,2) = A000005(n). - Omar E. Pol, Sep 17 2016

STATUS

reviewed

editing

Discussion

Wed Sep 21

11:49

Omar E. Pol: Minor edits.

#30 by G. C. Greubel at Sun Sep 18 11:28:11 EDT 2016

STATUS

proposed

reviewed

Discussion

Sun Sep 18

12:15

Joerg Arndt: Conjecture is trivially true.