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