A378419 Positive integers in A376842, sorted according to their appearance in that sequence.

8, 46, 6248, 5, 4268, 2684, 6842, 2, 4, 64, 28, 2486, 4862, 8426, 82, 6, 8624, 9, 3971, 7931, 19

Offset: 1

Author

Marco Ripà, Nov 25 2024

Keywords

• nonn
• fini
• more

Comments

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.

Examples

			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.
		

Links

• Marco Ripà, Graham's number stable digits: an exact solution, arXiv:2411.00015 [math.GM], 2024.
• Marco Ripà, Twelve Python Programs to Help Readers Test Peculiar Properties of Integer Tetration, ResearchGate, 2024. See pp. 22, 27.
• Wikipedia, Graham's Number.
• Wikipedia, Tetration.

Crossrefs

Cf. A317905, A372490, A373387, A376842.