476656

Appears in sequences

• Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1 <= k <= n; sequence gives f(n,n-2)/n.at n=29A019579
• a(n) = n*(n - 1)^3/2.at n=32A019582
• Products of the 4th power of a prime and a distinct prime of power 3 (p^4*q^3).at n=24A179666
• a(n) = floor(1/{(2+n^4)^(1/4)}), where {} = fractional part.at n=62A184537
• Numbers whose sum of proper square divisors is a palindrome in base 10 having at least two digits.at n=32A232892
• Numbers whose sum of square divisors is a palindrome in base 10 having at least two digits.at n=19A232893
• a(n) is the largest positive integer that is abundant and has the same prime signature as A025610(n) or 0 if no such number exists.at n=21A343329
• a(n) is the least k that is a multiple of d=A240991(n), with abundancy ratio sigma(k)/k equal to (sigma(d)+1)/d, or -1 if no such k exists.at n=12A387405
• Numbers k such that sigma(A253560(k)) / A253560(k) is equal to (sigma(k)+1) / k, where A253560(k) = k multiplied by its largest prime factor.at n=27A387406