82160

Appears in sequences

• Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=39A002492
• Binomial coefficient C(8n,n-7).at n=3A004388
• a(n) = Sum_{k=0..6} binomial(n,k).at n=21A008859
• Binomial coefficients C(n,77).at n=3A017741
• Binomial coefficients C(80,n).at n=3A017796
• a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=36A030003
• Number of 1-punctured staircase polygons (by perimeter) with a hole of perimeter 4.at n=14A055022
• a(n) = Sum_{k=0..n} C(n*(n+1)/2,k).at n=6A066383
• 3-apexes of Omega: numbers k such that Omega(k-3) < Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2) > Omega(k+3), where Omega(m) = the number of prime factors of m, counting multiplicity.at n=22A076760
• Series expansion for radius of gyration of self-avoiding walks on the square lattice.at n=6A121783
• 1/6 of product of three numbers: n-th prime, previous and following number.at n=21A127920
• The number of inequivalent ways to color the vertices of a regular octahedron using at most n colors.at n=11A198833
• Number of side-2 hexagonal 0..n arrays with values nondecreasing E, SW and SE.at n=10A216938
• Expansion of 2*(1+x^2)/((1-x)*(1-x-2*x^3)).at n=19A227036
• a(n) = binomial(3*n+2,3).at n=25A228888
• a(n) = binomial(2*n+2,n) - 2*binomial(2*n,n) + binomial(2*n-2,n).at n=9A262768
• Smallest tetrahedral number with exactly n divisors, or 0 if no such number exists.at n=39A279082
• a(n) = (5*n + 3)*(5*n + 4)*(5*n + 5)/6.at n=15A300522
• Number of ways to write n as an ordered sum of 8 squarefree numbers.at n=17A341068
• Number of n-step self-avoiding walks on the square Manhattan lattice that do not take two consecutive turns.at n=23A364580