458640
domain: N
Appears in sequences
- Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=22A019575
- 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,2).at n=6A019581
- Number of 2n-bead balanced binary strings of fundamental period 2n, rotationally equivalent to reverse, complement and reversed complement.at n=28A045665
- Highly abundant numbers (A002093) that are not Harshad numbers (A005349).at n=7A128702
- A triangle of recursive Fibonacci Lah numbers: f(n) = Fibonacci(n)*f(n - 1), L(n, k) = binomial(n-1, k-1)*(f(n)/f(k)).at n=29A137478
- Triangle T(n, k, q) = c(n,q)/( c(k,q)*c(n-k,q) ), where c(n, q) = Product_{j=1..n} f(n, q), f(n, q) = ( (1-q^n)*(1+(-1)^n) + n!*(1-(-1)^n) )/2, and q = 3, read by rows.at n=30A172428
- Triangle T(n, k, q) = c(n,q)/( c(k,q)*c(n-k,q) ), where c(n, q) = Product_{j=1..n} f(n, q), f(n, q) = ( (1-q^n)*(1+(-1)^n) + n!*(1-(-1)^n) )/2, and q = 3, read by rows.at n=33A172428
- Non-palindromes whose squares are in A066531.at n=28A206642
- Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=10A207591
- Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) i * (2m+n-1-i)!at n=23A211365
- Triangle used for the integral of even powers of the sine and cosine functions.at n=24A254933
- Highly composite numbers of class 6 (see comment in A275239).at n=30A275244
- Numbers m that divide sigma(sigma(m) - m) where sigma is the sum of divisors function (A000203).at n=32A300658
- Number of minimum total dominating sets in the n X n black bishop graph.at n=13A303141
- Number of minimum total dominating sets in the n X n white bishop graph.at n=12A303144
- Values of Euler's totient phi for A050498.at n=9A339883
- a(n) is the lowest nonnegative exponent k such that n!^k is the product of the divisors of n!.at n=27A344687
- Number of minimum vertex colorings in the complement of the wheel graph on n nodes.at n=10A371208