Counting Binary Quadratic Representations

Problem Statement

Let $g(n)$ denote the number of ways a positive integer $n$ can be represented in the form: $$x^2+xy+41y^2$$ where $x$ and $y$ are integers. For example, $g(53)=4$ due to $(x,y) \in \{(-4,1),(-3,-1),(3,1),(4,-1)\}$.

Define $\displaystyle T(N)=\sum_{n=1}^{N}g(n)$. You are given $T(10^3)=474$ and $T(10^6)=492128$.

Find $T(3^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
49.70 (73)
🥈 shs10978
49.70 (50)
🥉 masktroopuh
13.10 (15)
4 mmtg
8.10 (9)
5 jonnytang
1.00 (1)

Data

Stats

Your submissions will appear here

Recent Submissions

1
icy
$g(73)$, $35$ digits 1 week, 3 days ago
2
icy
$g(72)$, $35$ digits 1 week, 3 days ago
3
icy
$g(71)$, $34$ digits 1 week, 3 days ago
4
icy
$g(70)$, $34$ digits 1 week, 3 days ago
5
icy
$g(69)$, $33$ digits 1 week, 3 days ago