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.

A052249 Triangle T(n,k) (n >= 1, k >= 1) giving dimension of bigrading of Connes-Moscovici noncocommutative algebra.

Original entry on oeis.org

1, 1, 1, 0, 2, 1, 0, 1, 3, 1, 0, 0, 2, 4, 1, 0, 0, 1, 4, 5, 1, 0, 0, 0, 2, 6, 6, 1, 0, 0, 0, 1, 4, 9, 7, 1, 0, 0, 0, 0, 2, 7, 12, 8, 1, 0, 0, 0, 0, 1, 4, 11, 16, 9, 1, 0, 0, 0, 0, 0, 2, 7, 16, 20, 10, 1, 0, 0, 0, 0, 0, 1, 4, 12, 23, 25, 11, 1, 0, 0, 0, 0, 0, 0, 2, 7, 18, 31, 30, 12, 1, 0, 0
Offset: 0

Views

Author

David Broadhurst, Feb 05 2000

Keywords

Comments

With rows reversed, T(n,k) appears to be the number of partitions of n with k big parts, where a big part is a part >= 2 (0 <= k <= n/2). For example, with n=4, the 3 partitions 4, 31, 211 each have one big part. - David Callan, Aug 23 2011

Examples

			Triangle begins
  1;
  1, 1;
  0, 2, 1;
  0, 1, 3, 1;
  0, 0, 2, 4, 1;
  0, 0, 1, 4, 5, 1;
  ...
		

Crossrefs

Cf. A052250.

Programs

  • Mathematica
    t[n_, k_] := Count[ IntegerPartitions[n], pp_ /; Count[pp, p_ /; p >= 2] == k]; Flatten[ Table[ t[n, k], {n, 1, 14}, {k, n-1, 0, -1} ] ] (* Jean-François Alcover, Jan 23 2012, after David Callan *)