Consider the Euler totient function of a number x. 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 x.
A269309
Consider the Euler totient function of a number x. 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 x.
Terms
- a(0) =13a(1) =21a(2) =63a(3) =177a(4) =206a(5) =412a(6) =655a(7) =824a(8) =1990a(9) =2637a(10) =11438a(11) =12485a(12) =23846a(13) =34132a(14) =40528a(15) =56202a(16) =87539a(17) =94597a(18) =1288999a(19) =3075239a(20) =3106991a(21) =20689503a(22) =31173397a(23) =46230492a(24) =65889985a(25) =79476719a(26) =170859904a(27) =266368503a(28) =295845211a(29) =420471958
External references
- oeis: A269309