cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A357064 a(n) = k such that A091411(k) = A091409(n).

Original entry on oeis.org

1, 2, 3, 7, 418090195952691922788354
Offset: 1

Views

Author

Levi van de Pol, Sep 10 2022

Keywords

Comments

The existence of a(n) is proven in Lemma 1.2(a) of the article "The first occurrence of a number in Gijswijt's sequence". There, it is called t^{(1)}(n). In this article, a formula for the numbers t^{(m)}(n) is given. It looks like a tower of exponents and can be found in Theorem 6.20. This formula is then used to find a formula for the first occurrence of an integer n in Gijswijt's sequence, which is A091409(n).
The value of a(5) is calculated in Subsection 8.2 of the same article.
The value of a(6) is larger than 10^(10^100), so it would be impossible to include here.

Examples

			For n=4 we have A091411(7)=A091409(4). Therefore, a(4)=7.
		

Crossrefs