Expressing an Integer as the Sum of Triangular Numbers

Problem Statement

Gauss famously proved that every positive integer can be expressed as the sum of three triangular numbers (including $0$ as the lowest triangular number). In fact most numbers can be expressed as a sum of three triangular numbers in several ways.

Let $G(n)$ be the number of ways of expressing $n$ as the sum of three triangular numbers, regarding different arrangements of the terms of the sum as distinct.

For example, $G(9) = 7$, as $9$ can be expressed as: $3+3+3$, $0+3+6$, $0+6+3$, $3+0+6$, $3+6+0$, $6+0+3$, $6+3+0$.
You are given $G(1000) = 78$ and $G(10^6) = 2106$.

Find $G(6 \times 5^N)$.

Submit Answers

You need to submit in the format: "N:problem(N)", possibly with multiple values at once, separated by commas, with $N$ between $1$ and $100$.

Top Users

🥇 icy
82.00 (82)
🥈 shs10978
82.00 (82)
🥉 liuguangxi
75.00 (75)

Data

Stats

Your submissions will appear here

Recent Submissions

1
shs10978
$g(82)$, $30$ digits 3 weeks, 2 days ago
2
shs10978
$g(81)$, $29$ digits 3 weeks, 3 days ago
3
shs10978
$g(80)$, $29$ digits 3 weeks, 3 days ago
4
shs10978
$g(79)$, $29$ digits 3 weeks, 3 days ago
5
shs10978
$g(78)$, $28$ digits 3 weeks, 3 days ago