2324784

Appears in sequences

• Figurate numbers or binomial coefficients C(n,6).at n=37A000579
• Binomial coefficient C(37,n).at n=6A010953
• Binomial coefficient C(n,31).at n=6A010984
• a(n) = binomial(n, floor(n/6)).at n=37A051053
• Partial sums of A051740.at n=31A051877
• Binomial coefficients C(2*n-5,6).at n=15A053128
• a(n) = binomial(n, round(sqrt(n))).at n=37A055789
• Binomial coefficients formed from consecutive primes: a(n) = binomial( prime(n+1), prime(n) ).at n=10A058077
• a(n) = C(6*n+1,n).at n=6A079590
• Number of subsets of {1,2,...,n} in which exactly half of the elements are less than or equal to sqrt(n).at n=37A102366
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=8A104180
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=10A104180
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=14A104180
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=15A104180
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=17A104180
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=20A104180
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=22A104180
• Let f[n]=Prime[n+1]-Prime[n]; a(n) = Binomial[Prime[12],f[n]].at n=31A104180
• G.f.: Sum_{n>=0} log( 1/sqrt(1-2^n*x) )^n / n!.at n=6A201824
• 4-parking triangle T(r, i, 4) read by rows: T(r, i, k) = (r + 1)^(i-1)*binomial(k*(r + 1) + r - i - 1, r - i) with k = 4 and 0 <= i <= r.at n=29A329060