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.
%I A378419 #14 Dec 27 2024 11:13:36 %S A378419 8,46,6248,5,4268,2684,6842,2,4,64,28,2486,4862,8426,82,6,8624,9,3971, %T A378419 7931,19 %N A378419 Positive integers in A376842, sorted according to their appearance in that sequence. %C A378419 In Appendix of "Graham's number stable digits: an exact solution" (see Links) the author conjectures that this list is complete, and thus the present sequences has exactly 21 terms. %H A378419 Marco Ripà, <a href="https://arxiv.org/abs/2411.00015">Graham's number stable digits: an exact solution</a>, arXiv:2411.00015 [math.GM], 2024. %H A378419 Marco Ripà, <a href="https://www.researchgate.net/publication/387314761_Twelve_Python_Programs_to_Help_Readers_Test_Peculiar_Properties_of_Integer_Tetration">Twelve Python Programs to Help Readers Test Peculiar Properties of Integer Tetration</a>, ResearchGate, 2024. See pp. 22, 27. %H A378419 Wikipedia, <a href="https://en.wikipedia.org/wiki/Graham's_number">Graham's Number</a>. %H A378419 Wikipedia, <a href="https://en.wikipedia.org/wiki/Tetration">Tetration</a>. %e A378419 a(21) = 19 since n = 901 is the smallest n such that A376842(n) = 19, while a(1) to a(20) match (at least) one element of A376842(n) for some n < 901. %Y A378419 Cf. A317905, A372490, A373387, A376842. %K A378419 nonn,fini,more %O A378419 1,1 %A A378419 _Marco Ripà_, Nov 25 2024