Consider a number x > 1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the Euler totient function of x.

A269310

Consider a number x > 1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the Euler totient function of x.

Terms

    a(0) =22a(1) =44a(2) =55a(3) =88a(4) =98a(5) =136a(6) =162a(7) =166a(8) =241a(9) =462a(10) =1020a(11) =2040a(12) =2416a(13) =2899a(14) =3060a(15) =4080a(16) =5110a(17) =7942a(18) =10738a(19) =10996a(20) =15006a(21) =24822a(22) =57040a(23) =67054a(24) =70625a(25) =75588a(26) =96888a(27) =261524a(28) =301834a(29) =507471

External references