53680

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=31A099771
• a(n) = (prime(n)^5 - prime(n))/3.at n=4A138425
• Number of arrays of n+2 integers in -2..2 with sum zero and adjacent elements differing in absolute value.at n=8A202956
• Product of n and the sum of all divisors of all positive integers <= n.at n=39A256533
• Sum of the asymmetry degrees of all compositions of n with parts in {1,5}.at n=37A276065
• p-INVERT of (1,0,0,0,1,0,0,0,0,0,...), where p(S) = (1 - S)^2.at n=30A292325
• Number of nX2 0..1 arrays with every element unequal to 0, 1, 2, 4 or 5 king-move adjacent elements, with upper left element zero.at n=10A304341
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero dodecahedral numbers in exactly n ways, or -1 if no such integer exists.at n=17A360216
• a(n) = phi(11^n+1), where phi is Euler's totient function (A000010).at n=5A366690