45760

Appears in sequences

• Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=32A002492
• Binomial coefficient C(6n,n-8).at n=3A004363
• Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.at n=22A006566
• Binomial coefficients C(n,63).at n=3A017727
• Binomial coefficients C(66,n).at n=3A017782
• (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=30A030002
• G.f.: 1/((1-x)*(1-x^2))^5.at n=13A038165
• Number of permutations P of {1,2,...,n} such that P(1)=1 and |P^-1(i+1)-P^-1(i)| equals 1 or 2 for i=1,2,...,n-1.at n=27A038718
• Tenth column (m=9) of convolution triangle A059594(n,m).at n=7A059598
• Expansion of (5+10*x+x^2)/(1-x)^10.at n=6A059602
• Number of unicursal planar maps with n edges rooted at a vertex of odd valency (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).at n=6A069731
• a(n) = binomial(2 + 2^n,3).at n=6A092055
• Square table read by downward antidiagonals where T(n,k) = binomial(n+2^k-1,n).at n=48A092056
• a(n) = n*(n-1)*(n-2)*(n-3)*(n^2-3*n-2)/48.at n=13A093566
• Triangle read by rows: T(n,k)=2^k*binomial(2n-k,n-k), 1<=k<=n.at n=37A112326
• Triangle, read by rows, where T(n,k) = C( C(n+2,3) - C(k+2,3) + 2, n-k) for n>=k>=0.at n=32A126454
• Number of polygons on n vertices with exactly three faces.at n=8A128650
• Triangle of numbers a(n,k), n>=3, ceiling((n-3)/2)<=k<=n-3: a(n,k)=Sum[ Binomial[x + y + z, x]*Binomial[y + z, y]*Binomial[n - 2 - x - 2*y - 2*z, 2*n - 2*y - 5 - 2*k]*(2^x)*((-1)^z), {z, 0, (2*k - n + 3)/2}, {y, 0, n - 3 - k}, {x, 0, 2*k - n + 3 - 2*z}].at n=52A128781
• Triangle, read by rows, where T(n,k) = C(2^k + n-k-1, n-k).at n=51A137153
• Tetrahedral numbers n*(n+1)*(n+2)/6 with n, n+1 and n+2 nonprime.at n=19A152622