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 A358668 #63 Dec 23 2022 08:51:03 %S A358668 0,0,2,3,4,5,3,7,8,9,7,11,12,3,14,11,11,17,11,19,20,14,12,23,3,12,26, %T A358668 12,28,29,11,12,32,33,12,35,36,11,38,12,29,41,42,28,44,45,12,47,48,26, %U A358668 50,51,12,53,54,3,56,26,23,59,60,12,62,26,26,65,26,67,68 %N A358668 a(n) is the least m such that A359194^k(m) = n for some k >= 0 (where A359194^k denotes the k-th iterate of A359194). %C A358668 See A359214 for the corresponding minimal k's. %H A358668 Rémy Sigrist, <a href="/A358668/b358668.txt">Table of n, a(n) for n = 0..10000</a> %H A358668 Rémy Sigrist, <a href="/A358668/a358668.gp.txt">PARI program</a> %F A358668 a(n) <= n. %e A358668 The orbit of 0 under repeated application of A359194 is: %e A358668 0, 1, 0, ... %e A358668 So a(0) = a(1) = 0. %e A358668 The orbit of 2 under repeated application of A359194 is: %e A358668 2, 1, 0, 1, 0, ... %e A358668 So a(2) = 2. %e A358668 The orbit of 3 under repeated application of A359194 is: %e A358668 3, 6, 13, 24, 55, 90, 241, 300, 123, 142, 85, 0, 1, 0, ... %e A358668 So a(3) = a(6) = a(13) = a(24) = a(55) = a(90) = a(241) = a(300) = a(123) = a(142) = a(85) = 3. %o A358668 (PARI) See Links section. %Y A358668 Cf. A070167, A359194, A359214. %K A358668 nonn,base %O A358668 0,3 %A A358668 _Rémy Sigrist_, Dec 22 2022