98770

Appears in sequences

• a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=42A000447
• Binomial coefficients C(n,82).at n=3A017746
• Binomial coefficients C(85,n).at n=3A017801
• a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=38A030003
• Squarefree tetrahedral numbers.at n=24A070755
• Triangle, read by rows, where T(n,k) = C(C(n+2,3) - C(k+2,3), n-k) for n >= k >= 0.at n=41A126445
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, 0), (1, -1, -1), (1, 0, 1)}.at n=11A148626
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, 0), (1, -1, -1), (1, 0, 1)}.at n=11A148627
• Sequence related to Hankel transform of super-ballot numbers.at n=40A156126
• a(n) = binomial(3*n + 1,3).at n=27A228887
• a(n) = n*(n + 1)*(5*n - 4)/2.at n=34A237616
• a(n) = (32*n^3 - 2*n)/3.at n=21A267031
• a(n) = (5*n + 3)*(5*n + 4)*(5*n + 5)/6.at n=16A300522
• Squarefree tetrahedral numbers which are products of five distinct primes.at n=2A354976
• Irregular triangle read by rows where T(n,k) is the number of simple graphs covering n vertices with exactly k triangles, 0 <= k <= binomial(n,3).at n=50A372167
• Triangle read by rows, T(n,k) = (binomial(n,k)^3 - binomial(n,k))/6 for k=1..n-1 and n >= 2.at n=30A373101
• Triangle read by rows, T(n,k) = (binomial(n,k)^3 - binomial(n,k))/6 for k=1..n-1 and n >= 2.at n=33A373101