cp's OEIS Frontend

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.

A329197 Length of the n-th nontrivial cycle of the "ghost iteration" A329200.

This page as a plain text file.
%I A329197 #21 Nov 16 2019 13:59:34
%S A329197 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 A329197 3,3,5,3,3,6,6,3,17,3,3,3,3,5,7,6
%N A329197 Length of the n-th nontrivial cycle of the "ghost iteration" A329200.
%C A329197 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 A329197 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 A329197 The first cycle of A329200 is row 1 of A329196, (8290, 8969, 9102), of length 3 = a(1).
%e A329197 The second cycle of A329200 is row 2 of A329196, (17998, 24199, 21819, 20041, 22084, 21800, 20020), of length 7 = a(2).
%o A329197 (PARI) /* change T to #T in print statement of code for A329196 */
%Y A329197 Cf. A329196, A329200, A329198, A329342 (variant using A329201).
%K A329197 nonn,more
%O A329197 1,1
%A A329197 _M. F. Hasler_, Nov 10 2019
%E A329197 a(9)-a(35) from _Scott R. Shannon_, Nov 12 2019
%E A329197 a(36)-a(49) from _Lars Blomberg_, Nov 15 2019