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.

A235797 Triangle read by rows in which T(n,k) is the sum of the k-th largest elements in all overpartitions of n.

Original entry on oeis.org

2, 6, 2, 16, 6, 2, 34, 14, 6, 2, 68, 30, 14, 6, 2, 128, 60, 30, 14, 6, 2
Offset: 1

Views

Author

Omar E. Pol, Jan 18 2014

Keywords

Comments

It appears that T(n,k) is also the total number of parts >= k in all overpartitions of n.
It appears that the first differences of row n together with 2 give row n of triangle A235798.
The equivalent sequence for partitions is A181187.

Examples

			Triangle begins:
    2;
    6,  2;
   16,  6,  2;
   34, 14,  6,  2;
   68, 30, 14,  6,  2;
  128, 60, 30, 14,  6,  2;
  ...
		

Crossrefs