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 A264048 #11 Nov 25 2015 21:34:49 %S A264048 1,1,1,1,0,1,1,1,0,0,1,1,0,1,1,1,0,0,0,1,0,1,0,0,0,1,1,0,0,1,1,1,0,0, %T A264048 0,0,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,0,1,0,0,2,0,0,0,0,1,1,1,0,0,0,0, %U A264048 0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,1,0,0,0,0,1 %N A264048 Triangle read by rows: T(n,k) (n>=1, k>=1) is the number of integer partitions lambda of n such that there are k compositions mu such that the Gelfand-Tsetlin polytope for lambda and mu is integral. %C A264048 Row sums give A000041, n >= 1. %H A264048 FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000207">Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight</a>. %H A264048 J. De Loera and T. B. McAllister, <a href="http://arxiv.org/abs/math/0309329">Vertices of Gelfand-Tsetlin polytopes</a>, arXiv:math/0309329 [math.CO], 2003, MathSciNet:2096742. %e A264048 Triangle begins: %e A264048 1, %e A264048 1,1, %e A264048 1,0,1,1, %e A264048 1,0,0,1,1,0,1,1, %e A264048 1,0,0,0,1,0,1,0,0,0,1,1,0,0,1,1, %e A264048 1,0,0,0,0,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,0,1,0,0,2,0,0,0,0,1,1, %e A264048 ... %Y A264048 Cf. A000041, A264035, A264047, A264049. %K A264048 nonn,tabf %O A264048 1,57 %A A264048 _Christian Stump_, Nov 02 2015