login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053604 Number of ways to write n as an ordered sum of 3 nonzero triangular numbers. 16

%I #18 Dec 17 2023 09:11:52

%S 0,0,0,1,0,3,0,3,3,1,6,0,6,3,6,3,3,9,1,12,0,6,9,6,6,6,9,6,12,0,10,9,

%T 12,6,9,9,3,18,3,12,12,9,9,9,12,10,12,9,9,18,6,6,27,6,12,6,9,18,15,15,

%U 6,21,9,13,12,9,18,21,9,6,21,15,15,15,12,15,18,15,9

%N Number of ways to write n as an ordered sum of 3 nonzero triangular numbers.

%C Fermat asserted that every number is the sum of three triangular numbers. This was proved by Gauss, who recorded in his Tagebuch entry for Jul 10 1796 that: EYPHEKA! num = DELTA + DELTA + DELTA.

%D Mel Nathanson, Additive Number Theory: The Classical Bases, Graduate Texts in Mathematics, Volume 165, Springer-Verlag, 1996. See Chapter 1.

%H T. D. Noe, <a href="/A053604/b053604.txt">Table of n, a(n) for n=0..5050</a>

%F G.f.: ( Sum_{k>=1} x^(k*(k+1)/2) )^3. - _Ilya Gutkovskiy_, Dec 24 2016

%t nmax = 100; m0 = 10; A053604 :=

%t Table[a[n], {n, 0, nmax}]; Clear[counts];

%t counts[m_] :=

%t counts[m] = (Clear[a]; a[_] = 0;

%t Do[s = i*(i + 1)/2 + j*(j + 1)/2 + k*(k + 1)/2;

%t a[s] = a[s] + 1, {i, 1, m}, {j, 1, m}, {k, 1, m}];

%t A053603); counts[m = m0]; counts[m = 2*m]; While[

%t counts[m] != counts[m/2], m = 2*m]; A053604 (* _G. C. Greubel_, Dec 24 2016 *)

%Y Cf. A000217, A007294, A051611, A051533, A053603, A008443, A002636.

%K nonn

%O 0,6

%A _N. J. A. Sloane_, Jan 20 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:03 EDT 2024. Contains 371794 sequences. (Running on oeis4.)