Check the abundance of a number and iterate the test replacing at every step the sum of the divisors of the previous number. Sequence lists the least numbers whose abundances last n steps.
A286659
Check the abundance of a number and iterate the test replacing at every step the sum of the divisors of the previous number. Sequence lists the least numbers whose abundances last n steps.
Terms
- a(0) =1a(1) =12a(2) =30a(3) =104a(4) =88a(5) =40a(6) =24a(7) =402a(8) =228a(9) =260a(10) =150a(11) =3912a(12) =82860a(13) =55680a(14) =21210a(15) =21336a(16) =7872a(17) =3276a(18) =1170a(19) =360a(20) =120a(21) =54a(22) =5860a(23) =2502528a(24) =660660a(25) =225576a(26) =104094a(27) =107091522
External references
- oeis: A286659