146004

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=21A019579
• a(n) = n*(n - 1)^3/2.at n=24A019582
• The terms of A073215 (sums of two powers of 23) divided by 2.at n=13A072822
• a(n) = Sum_{k=0..n} F(k+1)^2*F(n-k+1)^2 where F = Fibonacci numbers (A000045).at n=11A136429
• Floor(1/{(9+n^4)^(1/4)}), where {} = fractional part.at n=68A184633
• Numbers for which the number of prime divisors counted with multiplicity and the sum of the distinct prime divisors are both perfect.at n=33A233563