[seqfan] a question about triangular numbers
mathoflove-seqfan at yahoo.com
Tue Dec 8 18:34:05 CET 2009
Every number can be represented as a sum of three triangular numbers.
I need to know the following sequence: a(n) is the largest possible triangular number when n is represented as a sum of three triangular numbers. The sequence should start 1, 1, 3, 3, 3, 6, 6, 6, 6, which coincides with http://www.research.att.com/~njas/sequences/A057944
Are they the same? Does anyone know a formula?
More information about the SeqFan