40920

Appears in sequences

• Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=33A000332
• Binomial coefficient C(3n,n-7).at n=4A004325
• Number of intersections of diagonals in the interior of a regular n-gon.at n=32A006561
• 11-gonal (or hendecagonal) pyramidal numbers: a(n) = n*(n+1)*(3*n-2)/2.at n=30A007586
• Binomial coefficient C(33,n).at n=4A010949
• Binomial coefficient C(n,29).at n=4A010982
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the smallest integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=17A049909
• T(n,4), array T as in A050186; a count of aperiodic binary words.at n=29A050189
• Denominators of row 4 of table described in A051714/A051715.at n=28A051723
• Binomial coefficients binomial(2*n-3,4).at n=14A053126
• a(n) = binomial(n,floor(n/7)).at n=33A062947
• First differences of A048093.at n=32A084919
• Numbers that can be expressed as the difference of the squares of primes in exactly six distinct ways.at n=23A092002
• (Prime(prime(n))^2-1)/24.at n=37A092772
• Triangle, read by rows, where T(n,k) = binomial(n*(n-1)/2 - k*(k-1)/2 + n-k+3, n-k).at n=50A107873
• Numbers n such that F(2*n - 1) is prime, where F(m) is a Fibonacci number.at n=31A117595
• Triangle, read by rows, where T(n,k) = C( n*(n+1)/2 + n-k + 1, n-k), for n>=k>=0.at n=31A121335
• Perimeter s/6 (divided by 6) of primitive Pythagorean triangles such that perimeters are Averages of twin prime pairs, q=p+1, a=q^2-p^2, c=q^2+p^2, b=2*p*q, s=a+b+c, s-+1 are primes.at n=22A155176
• Triangle T(n, k, m) = f(n, m)/(f(k, m)*f(n-k, m)), where T(0, k, m) = 1, f(n, k) = Product_{j=1..n} ( j!*((k+1)^j -1)/k ), f(n, 0) = n!, and m = 3, read by rows.at n=16A156767
• Triangle T(n, k, m) = f(n, m)/(f(k, m)*f(n-k, m)), where T(0, k, m) = 1, f(n, k) = Product_{j=1..n} ( j!*((k+1)^j -1)/k ), f(n, 0) = n!, and m = 3, read by rows.at n=19A156767