OFFSET
0,2
COMMENTS
Number of ways of writing n as the sum of 12 triangular numbers from A000217.
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. Case k=12, Theorem 7.
FORMULA
From Wolfdieter Lang, Jan 13 2017: (Start)
G.f.: 12th power of g.f. for A010054.
a(0) = 1, a(n) = (12/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 12*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017
EXAMPLE
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Seiichi Manyama, May 05 2017
STATUS
approved