A328865 The first repeating term in the trajectory of n under iterations of A329623, or -1 if no such terms exists.
1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
Offset: 1
Examples
a(10) = 9 as A329623(10) = 9, and A329623(9) = 9, thus 9 is the first repeating value. a(128) = 182, as A329623(128) = 182, A329623(182) = 728, A329623(728) = 182, thus 182 is the first repeating value. a(210) = 637, as A329623(210) = 179, A329623(179) = 637, A329623(637) = 273, A329623(273) = 637, thus 637 is the first repeating value.
Links
- Scott R. Shannon, Table of n, a(n) for n = 1..10000
Programs
-
PARI
A328865(n,L=n^10)={my(o);-!until(n>L,o==(n=A329623(o=n))&&return(n))} \\ M. F. Hasler, Dec 06 2019
Extensions
Incorrect comment, link and program deleted following an observation by Scott R. Shannon, Nov 27 2019
Comments