A257810 Smallest number of the cycle in which n ends under iteration of sum-of-the-square-of-two-digits.
1, 37, 37, 37, 41, 41, 41, 41, 37, 1, 41, 41, 41, 41, 37, 37, 41, 41, 37, 37, 1268, 41, 41, 41, 41, 41, 41, 1946, 37, 37, 41, 41, 37, 37, 41, 41, 37, 37, 41, 37, 41, 41, 1946, 41, 37, 41, 1946, 37, 41, 41, 5965, 41, 41, 41, 41, 37, 1781, 41, 37, 41, 41, 41, 1268, 41, 41, 37, 37, 41, 37, 41, 41, 41, 41, 5965, 37, 37, 41, 41, 41, 41, 37, 37, 41, 37, 41, 41, 37, 41, 41, 37, 41, 41, 41, 41, 37, 41, 41, 41, 41, 1
Offset: 1
Examples
s_2^[3](51)=5965, since 51^2 = 2601 => 26^2+1^2 = 677 => 6^2+77^2 = 5965 => 59^2+ 65^2 = 7706 => 77^2+6^2 = 5965. Three iterations are needed to reach the 2-cycle (5965, 7706).
Links
- Pieter Post, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
PARI
apply( {A257810(n)=for(i=0,1, my(S=[n]); while(!setsearch(S, n=norml2(digits(n, 100))), S=setunion(S, [n])); i && n=S[1]); n}, [1..99]) \\ M. F. Hasler, Dec 20 2024
Extensions
Edited by Wolfdieter Lang, Jun 08 2015
Comments