51450

Appears in sequences

• Expansion of 1/((1-x)*(1-2x)*(1-5x)*(1-6x)).at n=5A021114
• Beginning with sequence A096903, choose only those rows such that when a(n) is in factored form all exponents of a(n) are consecutive starting at 1.at n=40A117311
• Coordination sequence for 12-dimensional cyclotomic lattice Z[zeta_21].at n=5A126902
• Totally multiplicative sequence with a(p) = 7*(p+3) for prime p.at n=11A167326
• a(n) equals the coefficient of x^n in the (n-1)-th iteration of x*(1+x)/(1-x) for n>=1.at n=5A185522
• Numbers n for which there exists k < n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=7A255335
• The least number k > A255334(n) for which A000203(k) = A000203(A255334(n)) and A007947(k) = A007947(A255334(n)), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=7A255423
• a(n) = A276086(A276086(n)), where A276086 is the primorial base exp-function.at n=38A276087
• A variant of A322827.at n=50A322825
• Coefficients a(n) of x^n*y^n*z^n in function A = A(x,y,z) such that A = 1 + x*B*C, B = 1 + y*C*A, and C = 1 + z*A*B, for n >= 0.at n=4A323325
• Number of permutations of the prime indices of n! with at least one non-singleton run.at n=9A335459
• Number of tieless quidditch games with n scoring events.at n=17A335974
• Number of 4 X 4 matrices in Hermite normal form with determinant n.at n=34A389108
• Irregular triangular array read by rows: T(n,k) is the number of compatible pairs (f,g) of functions from [n] into [n] such that the integer partition induced by f and g is the k-th partition in the canonical (reverse lexicographic) ordering of the partitions, n>=0, 1<=k<=A000041(n).at n=34A390121