A226255 Number of ways of writing n as the sum of 11 triangular numbers.

1, 11, 55, 176, 440, 957, 1848, 3245, 5412, 8580, 12892, 18888, 26895, 36916, 50160, 66935, 86658, 111870, 142582, 177320, 221100, 272690, 329065, 399102, 480040, 566808, 672969, 793760, 920326, 1074040, 1248412, 1425974, 1640595, 1882145, 2123385, 2418339, 2743928, 3062895, 3453978, 3880855

Offset

0,2

Links

Seiichi Manyama, Table of n, a(n) for n = 0..10000

K. Ono, S. Robins and P. T. Wahl, On the representation of integers as sums of triangular numbers, Aequationes mathematicae, August 1995, Volume 50, Issue 1-2, pp 73-94.

Formula

G.f. is 11th power of g.f. for A010054.

a(0) = 1, a(n) = (11/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017

G.f.: exp(Sum_{k>=1} 11*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

Crossrefs

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.

Sequence in context: A047649 A010927 A009550 * A022606 A072025 A098992

Adjacent sequences: A226252 A226253 A226254 * A226256 A226257 A226258

Keyword

nonn

Author

N. J. A. Sloane, Jun 01 2013

Status

approved