45362

Appears in sequences

• a(0)=1. a(n) = a(n-1)*(n+1), if n is in the sequence. a(n)= a(n-1) +1, if n is missing from the sequence.at n=11A118471
• Finite sequence of numbers n such that iterations for the map r -> A061602(r) starting with n ends with the same number n.at n=9A188284
• List of amicable sums-of-factorial-of-digits pairs (A,B): A equals the sum of the factorials of B's digits in base 10, and vice versa.at n=3A214285
• Amicable factorions.at n=7A254499
• a(n) is the smallest k such that A342068(k) = n.at n=21A342069
• Number of partitions of n with at most five part sizes.at n=43A364809