49120

Appears in sequences

• Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.at n=26A099771
• Number of partitions of n such that the largest part and the smallest part are relatively prime.at n=41A117087
• Expansion of g.f.: x/((1-x^2)^5 - 1 + x).at n=7A123890
• Triangle T(n,k) = (2*n-k-1)*T(n-1,k-1) + (k+1)*T(n-1,k), with T(n,1) = T(n,n) = 1, 1 <= k <= n, read by rows.at n=34A156139
• Total number of adjacent node merge operations to turn a circular list of size n to a node.at n=7A309490