Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k.
A263534
Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k.
Terms
- a(0) =29a(1) =76a(2) =157a(3) =174a(4) =191a(5) =475a(6) =713a(7) =1129a(8) =1961a(9) =3286a(10) =4424a(11) =7812a(12) =8973a(13) =19978a(14) =24317a(15) =35845a(16) =37041a(17) =51712a(18) =68022a(19) =166838a(20) =443275a(21) =444247a(22) =445219a(23) =509439a(24) =706317a(25) =1189312a(26) =1933197a(27) =2686010a(28) =10809303a(29) =55558901
External references
- oeis: A263534