|
%I #21 Nov 16 2019 13:59:34
%S 5,6,3,7,5,9,6,3,3,5,3,3,6,3,3,3,5,3,3,6,3,3,3,3,5,3,3,6,3,17,3,11,3,
%T 3,3,5,3,3,6,6,3,17,3,3,3,3,5,7,6
%N Length of the n-th nontrivial cycle of the "ghost iteration" A329200.
%C A329200 consists in adding or subtracting the number A040115(n) whose digits are the differences of adjacent digits of n, depending on its parity.
%C Repdigits A010785 are fixed points of this map, but some numbers enter nontrivial cycles. This sequence gives the length of these cycles, ordered by their smallest member, as they are listed in the table A329196. See there for more information.
%e The first cycle of A329200 is row 1 of A329196, (8290, 8969, 9102), of length 3 = a(1).
%e The second cycle of A329200 is row 2 of A329196, (17998, 24199, 21819, 20041, 22084, 21800, 20020), of length 7 = a(2).
%o (PARI) /* change T to #T in print statement of code for A329196 */
%Y Cf. A329196, A329200, A329198, A329342 (variant using A329201).
%K nonn,more
%O 1,1
%A _M. F. Hasler_, Nov 10 2019
%E a(9)-a(35) from _Scott R. Shannon_, Nov 12 2019
%E a(36)-a(49) from _Lars Blomberg_, Nov 15 2019
|
