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 A372707 #33 Sep 22 2024 07:24:31
%S A372707 0,1,3,18,35,207,774,1513,2051,8900,13459,25907,34305,88036,153839,
%T A372707 382283,397590,636459,844177,1456073,2426735,7312307,11716125,
%U A372707 14657311,43165242,52706549,84955821,188736643,416569989,953350161,1617152961,2541237149,4847485412
%N A372707 Smallest natural number requiring n applications of the map x -> 2^x mod x = A015910(x) to reach 0.
%C A372707 A015910 is conjectured to contain every natural number except for 1, which would imply that this sequence has infinitely many terms.
%H A372707 Kevin Ryde, <a href="/A372707/b372707.txt">Table of n, a(n) for n = 0..45</a>
%H A372707 Kevin Ryde, <a href="/A372707/a372707.c.txt">C Code</a>
%o A372707 (Python)
%o A372707 i = 0
%o A372707 c = [0]
%o A372707 for j in range(10**9):
%o A372707 if c[-1] == i:
%o A372707 print(f"a({i}) = {j}")
%o A372707 i += 1
%o A372707 c.append(1+c[pow(2, len(c), len(c))])
%o A372707 (C) /* See links. */
%Y A372707 Cf. A015910.
%K A372707 nonn
%O A372707 0,3
%A A372707 _Bryle Morga_, May 11 2024
%E A372707 a(30)-a(32) from _Michael S. Branicky_, May 12 2024