a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate.
A351328
a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =3a(4) =6a(5) =720a(6) =5043a(7) =151a(8) =122a(9) =5a(10) =120a(11) =4a(12) =24a(13) =26a(14) =722a(15) =5044a(16) =169a(17) =363601a(18) =1454a(19) =7a(20) =5040a(21) =146a(22) =745a(23) =5184a(24) =40465a(25) =889a(26) =443520a(27) =177a(28) =10081a(29) =40324
External references
- oeis: A351328