Golomb's Self-describing Sequence

Problem Statement

The Golomb's self-describing sequence $(G(n))$ is the only nondecreasing sequence of natural numbers such that $n$ appears exactly $G(n)$ times in the sequence. The values of $G(n)$ for the first few $n$ are

$$ \begin{matrix} n & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & \ldots \\ G(n) & 1 & 2 & 2 & 3 & 3 & 4 & 4 & 4 & 5 & 5 & 5 & 6 & 6 & 6 & 6 & \ldots \end{matrix} $$

You are given that $G(10^3) = 86$ and $G(10^6) = 6137$.

Find $G(2^{3N})$.

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
39.94 (83)
🥈 shs10978
39.94 (40)
🥉 mmtg
7.94 (8)
4 Nondegon
7.94 (8)
5 jonnytang
6.06 (7)
6 CandynightJ
2.00 (2)

Data

Stats

Your submissions will appear here

Recent Submissions

1
shs10978
$g(40)$, $23$ digits 1 week, 6 days ago
2
shs10978
$g(39)$, $22$ digits 1 week, 6 days ago
3
shs10978
$g(38)$, $22$ digits 1 week, 6 days ago
4
shs10978
$g(37)$, $21$ digits 1 week, 6 days ago
5
shs10978
$g(36)$, $21$ digits 1 week, 6 days ago