Number of steps before n1(i) = n2(i) when n1(i) = n1(i-1) + digsum(n2(i-1)), n2(i) = n2(i-1) + digsum(n1(i-1)) and n1(1) = 10^(n-1), n2(1) = 0.
A272233
Number of steps before n1(i) = n2(i) when n1(i) = n1(i-1) + digsum(n2(i-1)), n2(i) = n2(i-1) + digsum(n1(i-1)) and n1(1) = 10^(n-1), n2(1) = 0.
Terms
- a(0) =1a(1) =12a(2) =57a(3) =22820a(4) =754504
External references
- oeis: A272233