28392

Appears in sequences

• a(n) = n^2*(n+1)^2*(n+2)/12.at n=12A004302
• Number of 5-unbalanced strings of length n (=2^n-A027560(n)).at n=16A027562
• Molien series for complete weight enumerator of self-dual code over GF(5) containing all-1's vector.at n=21A028345
• a(n) = floor(n/2) * floor((n-1)/2) * floor((n-2)/2) * floor((n-3)/2) * floor((n-4)/2) / 12.at n=28A028725
• a(n) = n^3 * Product_{p|n, p prime} (1 + 1/p).at n=25A033196
• a(n) = n*(n-1)^2*(n-2).at n=12A047928
• Partial sums of A051798.at n=11A051879
• Partial sums of A051836.at n=11A051923
• Numbers k such that sigma (x) = k has exactly 11 solutions.at n=34A060678
• When expressed in base 3 and then interpreted in base 7, is a multiple of the original number.at n=34A062884
• Product of product of divisors of n and sum of divisors of n.at n=25A076722
• Numbers whose set of base 13 digits is {0,C}, where C base 13 = 12 base 10.at n=12A097259
• Measures of entanglement in 3-qbits.at n=22A129548
• a(n) = (n-th prime)^4-(n-th prime)^2.at n=5A138402
• Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=4A162783
• Fibonacci double product triangle:If[n == 1, 1, If[n == 0, 1, Product[Fibonacci[(i - 1)]*Fibonacci[i], {i, 2, n}]]];t(n,m)=c(n)/(c(m)*c(n-m)).at n=42A173886
• Fibonacci double product triangle:If[n == 1, 1, If[n == 0, 1, Product[Fibonacci[(i - 1)]*Fibonacci[i], {i, 2, n}]]];t(n,m)=c(n)/(c(m)*c(n-m)).at n=38A173886
• A product triangle sequence based on:a=1;f(n, a) = f(n - 1, a) + a*f(n - 2, a); c(n,a)=If[n == 0, 1, Product[f(i, a)*f(i + 1, a), {i, 1, n}]]; t(n,m,a)=If[Floor[n/2] >= m, c(n, a)/c(n - m, a), c(n, a)/c(m, a)].at n=33A174411
• A product triangle sequence based on:a=1;f(n, a) = f(n - 1, a) + a*f(n - 2, a); c(n,a)=If[n == 0, 1, Product[f(i, a)*f(i + 1, a), {i, 1, n}]]; t(n,m,a)=If[Floor[n/2] >= m, c(n, a)/c(n - m, a), c(n, a)/c(m, a)].at n=30A174411
• Oblong numbers that are the product of two oblong numbers.at n=14A188660