A257948 Length of cycle in which n ends under iteration of sum-of-squares-of-two-digits map s_2.
1, 35, 35, 35, 56, 56, 56, 56, 35, 1, 56, 56, 56, 56, 35, 35, 56, 56, 35, 35, 10, 56, 56, 56, 56, 56, 56, 14, 35, 35, 56, 56, 35, 35, 56, 56, 35, 35, 56, 35, 56, 56, 14, 56, 35, 56, 14, 35, 56, 56, 2, 56, 56, 56, 56, 35, 5, 56, 35, 56, 56, 56, 10, 56, 56, 35, 35, 56, 35, 56, 56, 56, 56, 2, 35, 35, 56, 56, 56, 56, 35, 35, 56, 35, 56, 56, 35, 56, 56, 35, 56, 56, 56, 56, 35, 56, 56, 56, 56, 1
Offset: 1
Examples
s_2^[9](2)= 35, because 2^2=4=> 4^2=16 => 16^2=256 => 2^2+56^2=3140 => 31^2+40^2=2561 => 25^2+61^2=4346 => 43^2+46^2=3965 => 39^2+65^2=5746 => 57^2+46^2=5365=> 53^2+65^2= 7034. Nine iterations are needed to reach the 35-cycle. s_2^[3](51)=2, since 51^2 = 2601 => 26^2+1^2 = 677 => 6^+77^2 = 5965 => 59^2+ 65^2 = 7706 => 77^2+6^2 = 5965. Three iterations are needed to reach the 2-cycle.
Links
- Pieter Post, Table of n, a(n) for n = 1..9999
Comments