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 A226255 #21 Aug 01 2017 11:50:43
%S A226255 1,11,55,176,440,957,1848,3245,5412,8580,12892,18888,26895,36916,
%T A226255 50160,66935,86658,111870,142582,177320,221100,272690,329065,399102,
%U A226255 480040,566808,672969,793760,920326,1074040,1248412,1425974,1640595,1882145,2123385,2418339,2743928,3062895,3453978,3880855
%N A226255 Number of ways of writing n as the sum of 11 triangular numbers.
%H A226255 Seiichi Manyama, <a href="/A226255/b226255.txt">Table of n, a(n) for n = 0..10000</a>
%H A226255 K. Ono, S. Robins and P. T. Wahl, <a href="http://www.mathcs.emory.edu/~ono/publications-cv/pdfs/006.pdf">On the representation of integers as sums of triangular numbers</a>, Aequationes mathematicae, August 1995, Volume 50, Issue 1-2, pp 73-94.
%F A226255 G.f. is 11th power of g.f. for A010054.
%F A226255 a(0) = 1, a(n) = (11/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - _Seiichi Manyama_, May 06 2017
%F A226255 G.f.: exp(Sum_{k>=1} 11*(x^k/k)/(1 + x^k)). - _Ilya Gutkovskiy_, Jul 31 2017
%Y A226255 Number of ways of writing n as a sum of k triangular numbers, for k=1,...: A010054, A008441, A008443, A008438, A008439, A008440, A226252, A007331, A226253, A226254, A226255, A014787, A014809.
%K A226255 nonn
%O A226255 0,2
%A A226255 _N. J. A. Sloane_, Jun 01 2013