

A329197


Length of the nth nontrivial cycle of the "ghost iteration" A329200.


10



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, 3, 3, 5, 3, 3, 6, 6, 3, 17, 3, 3, 3, 3, 5, 7, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

A329200 consists in adding or subtracting the number A040115(n) whose digits are the differences of adjacent digits of n, depending on its parity.
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.


LINKS

Table of n, a(n) for n=1..49.


EXAMPLE

The first cycle of A329200 is row 1 of A329196, (8290, 8969, 9102), of length 3 = a(1).
The second cycle of A329200 is row 2 of A329196, (17998, 24199, 21819, 20041, 22084, 21800, 20020), of length 7 = a(2).


PROG

(PARI) /* change T to #T in print statement of code for A329196 */


CROSSREFS

Cf. A329196, A329200, A329198, A329342 (variant using A329201).
Sequence in context: A199666 A307619 A123852 * A153614 A328905 A195709
Adjacent sequences: A329194 A329195 A329196 * A329198 A329199 A329200


KEYWORD

nonn,more


AUTHOR

M. F. Hasler, Nov 10 2019


EXTENSIONS

a(9)a(35) from Scott R. Shannon, Nov 12 2019
a(36)a(49) from Lars Blomberg, Nov 15 2019


STATUS

approved



