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.

A098489 Triangle T(n,k) read by rows: partitions of n with parts occurring at most thrice, k parts occurring once or twice and an even number of parts.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 2, 0, 2, 3, 0, 0, 2, 3, 1, 0, 2, 4, 2, 1, 2, 4, 4, 0, 4, 7, 3, 1, 0, 3, 8, 7, 1, 1, 3, 9, 10, 2, 0, 4, 12, 12, 4, 0, 5, 14, 15, 7, 2, 5, 13, 21, 11, 0, 0, 6, 19, 26, 14, 1, 0, 7, 22, 32, 20, 2, 2, 6, 24, 42, 26, 4, 0, 8, 30, 49, 35, 7, 0, 8, 36, 60
Offset: 0

Views

Author

Ralf Stephan, Sep 12 2004

Keywords

Examples

			Triangle begins:
  {1}
  {0,0}
  {0,1}
  {0,0,1}
  {0,1,1}
  {0,1,2}
  {0,2,3,0}
  ...
6 is 1+1+1+3, 1+1+2+2, 1+5, 2+4, 3+3 with even number of parts and no part more than thrice. Two of these partitions have one part occurring once or twice and (the middle) three have two such parts. The 6th row is therefore 0,2,3,0.
		

Crossrefs

Differs from A098490 in rows with triangular index. Cf. A098493.
Row sums are in A098491.