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.

A330368 Irregular triangle read by rows in which row n lists the ranks of the partitions of n in nonincreasing order.

Original entry on oeis.org

0, 1, -1, 2, 0, -2, 3, 1, 0, -1, -3, 4, 2, 1, 0, -1, -2, -4, 5, 3, 2, 1, 1, 0, -1, -1, -2, -3, -5, 6, 4, 3, 2, 2, 1, 0, 0, 0, -1, -2, -2, -3, -4, -6, 7, 5, 4, 3, 3, 2, 2, 1, 1, 1, 0, 0, -1, -1, -1, -2, -2, -3, -3, -4, -5, -7, 8, 6, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 0, 0, 0, 0, -1, -1, -1, -2, -2, -2, -3, -3, -4, -4, -5, -6, -8
Offset: 1

Views

Author

Omar E. Pol, Dec 12 2019

Keywords

Comments

The rank of a partition is the largest part minus the number of parts.
For more about this ordering, see A330370.
First differs from A105805 at a(49) = T(7,5).

Examples

			Triangle begins:
                              0;
                            1, -1;
                          2,  0, -2;
                      3,  1,  0, -1, -3;
                  4,  2,  1,  0, -1, -2, -4;
          5,  3,  2,  1,  1,  0, -1, -1, -2, -3, -5;
  6,  4,  3,  2,  2,  1,  0,  0,  0, -1, -2, -2, -3, -4, -6;
...
		

Crossrefs

Row n has length A000041(n).
Row sums give A000004.

Extensions

Edited by N. J. A. Sloane, Sep 15 2020