43050

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 triangle of numbers f(n,k)/n.at n=23A019576
• 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,3)/n.at n=4A019578
• At these values of k, the 1st, 2nd, 3rd and 4th cyclotomic polynomials all give prime numbers.at n=7A070025
• Number of 0..2 arrays of length n+7 with sum less than 8 in any length 8 subsequence (=less than 50% duty cycle).at n=3A212725
• T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum less than 2*k in any length 2k subsequence (=less than 50% duty cycle).at n=24A212729
• Number of 0..2 arrays of length 2*n+3 with sum less than 2*n in any length 2n subsequence (=less than 50% duty cycle).at n=3A212733
• a(n) = A238823(n) - A238826(n).at n=13A238829
• Numbers n such that n is the average of four consecutive primes n-13, n-1, n+1 and n+13.at n=6A260959
• Unitary practical numbers that are nonsquarefree.at n=32A287173