GCD Sequence

Problem Statement

Let $g(n)$ be a sequence defined as follows:
$g(4) = 13$,
$g(n) = g(n-1) + \gcd(n, g(n-1))$ for $n \gt 4$.

The first few values are:

$n$4567891011121314151617181920...
$g(n)$1314161718272829303132333451545560...

You are given that $g(1\,000) = 2524$ and $g(1\,000\,000) = 2624152$.

Find $g(8^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
100.00 (100)
🥈 shs10978
100.00 (100)
🥉 liuguangxi
100.00 (100)
4 mmtg
8.00 (8)
5 jonnytang
3.00 (3)

Data

Stats

Your submissions will appear here

Recent Submissions

1
mmtg
$g(8)$, $8$ digits 3 weeks, 5 days ago
2
mmtg
$g(7)$, $7$ digits 3 weeks, 5 days ago
3
mmtg
$g(6)$, $6$ digits 3 weeks, 5 days ago
4
mmtg
$g(5)$, $5$ digits 3 weeks, 5 days ago
5
mmtg
$g(4)$, $5$ digits 3 weeks, 5 days ago