42851

Appears in sequences

• a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393).at n=24A308305
• A self-"read and extend" sequence built following the rules visible in the Comments section (a kind of Collatz-by-digits sequence).at n=20A316764
• Numbers that equal to the sum of their iterated absolute Möbius divisor function (A173557).at n=16A333873