46376
domain: N
Appears in sequences
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=34A000332
- Fermat coefficients.at n=14A000971
- Binomial coefficient C(34,n).at n=4A010950
- Binomial coefficient C(n,30).at n=4A010983
- Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=28A011796
- a(n) = floor(binomial(n,5)/6).at n=34A011843
- Number of necklaces with 6 black beads and n-6 white beads.at n=29A032191
- Schoenheim bound L_1(n,6,5).at n=28A036833
- Molien series for 3-D group X1.at n=29A037240
- Binomial coefficients C(2*n+4,4).at n=15A053134
- a(n) = ceiling(binomial(n,6)/n).at n=34A053643
- a(n) = binomial(n,floor(n/7)).at n=34A062947
- a(n) = lcm(n, n+1, n+2, n+3)/12.at n=30A067047
- a(n) = lcm(n, n+1, n+2, n+3, n+4) / 60.at n=29A067048
- Convolution of odd primes with themselves.at n=27A084370
- First differences of A048093.at n=33A084919
- a(n) = Sum_{i=1..n} C(i+3,4)^3.at n=3A086024
- Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.at n=34A093346
- Second row of array in A101385.at n=21A101644
- Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k + 2, n-k), for n>=k>=0.at n=31A121336