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.
%I A052249 #17 Oct 07 2017 02:38:29
%S A052249 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,
%T A052249 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,
%U A052249 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
%N A052249 Triangle T(n,k) (n >= 1, k >= 1) giving dimension of bigrading of Connes-Moscovici noncocommutative algebra.
%C A052249 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
%H A052249 D. J. Broadhurst and D. Kreimer, <a href="http://arXiv.org/abs/hep-th/0001202">Towards cohomology of renormalization: bigrading the combinatorial Hopf algebra of rooted trees</a>, arXiv:hep-th/0001202, 2000.
%e A052249 Triangle begins
%e A052249 1;
%e A052249 1, 1;
%e A052249 0, 2, 1;
%e A052249 0, 1, 3, 1;
%e A052249 0, 0, 2, 4, 1;
%e A052249 0, 0, 1, 4, 5, 1;
%e A052249 ...
%t A052249 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_ *)
%Y A052249 Cf. A052250.
%K A052249 nonn,tabl,nice
%O A052249 0,5
%A A052249 _David Broadhurst_, Feb 05 2000