318231

Appears in sequences

• a(1)=1; a(n) = the reversal of (a(n-1) + sfd(a(n-1))), where sfd(n)= sum of factorials of the digits of n.at n=6A121103
• a(n) is the least k such that A366912(k) = n.at n=20A366913