# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a008439 Showing 1-1 of 1 %I A008439 #31 Aug 02 2017 10:22:45 %S A008439 1,5,10,15,25,31,35,55,60,60,90,90,95,135,125,126,170,180,175,215,220, %T A008439 195,285,280,245,340,300,320,405,350,351,450,465,415,515,480,425,620, %U A008439 590,505,655,625,590,755,660,650,805,770,755,855,841,730,1045,960,770,1100 %N A008439 Expansion of Jacobi theta constant theta_2^5 /32. %C A008439 Also number of ways of writing n as a sum of five triangular numbers. - _N. J. A. Sloane_, Jun 01 2013 %D A008439 J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 102. %H A008439 Seiichi Manyama, Table of n, a(n) for n = 0..10000 %H A008439 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. %F A008439 a(0) = 1, a(n) = (5/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - _Seiichi Manyama_, May 06 2017 %F A008439 G.f.: exp(Sum_{k>=1} 5*(x^k/k)/(1 + x^k)). - _Ilya Gutkovskiy_, Jul 31 2017 %t A008439 a002129[n_]:=-Sum[(-1)^d*d, {d, Divisors[n]}]; a[n_]:=a[n]=If[n==0, 1, 5 Sum[a002129[k] a[n - k], {k, n}]/n]; Table[a[n], {n, 0, 100}] (* _Indranil Ghosh_, Aug 02 2017 *) %Y A008439 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 A008439 nonn %O A008439 0,2 %A A008439 _N. J. A. Sloane_ %E A008439 More terms from _Seiichi Manyama_, May 05 2017 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE