194040

Appears in sequences

• a(n) = n*(n-1)^2*(n-2).at n=20A047928
• a(n) = n*Pell(n-2).at n=14A093969
• a(n) = C(n+4,4) * C(n+6,6).at n=6A105947
• a(n) = binomial(n+6, 6) * binomial(n+8, 6).at n=4A107397
• a(n) =(A001359[n]^2-1)/2.at n=34A117849
• Coefficients of series giving the best rational approximations to sqrt(6).at n=2A123479
• Quasi-mirror of A062196 formatted as a triangular array.at n=49A124051
• Number of cells in the 2nd rows of all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=7A134437
• Number of parenthesizings of products formed by n factors assuming nonassociativity and partial commutativity: individual factors commute, but bracketed expressions don't commute with anything.at n=6A137591
• Products of two or more consecutive numbers that do not have prime gaps in their factorizations.at n=37A137895
• Irregular triangle, read by rows, T(n, k) = binomial(2*n, k)*binomial(2*k, k).at n=31A156789
• Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=4A162808
• First differences of A175111.at n=7A175112
• Oblong numbers that are the product of two oblong numbers.at n=25A188660
• Numbers with prime factorization pqr^2s^2t^3.at n=2A190386
• Triangular array read by rows: T(n,k) is the number of f:{1,2,...,n}->{1,2,...,n} with exactly 2k elements that have a preimage of even (possibly zero) cardinality; n>=0, 0<=k<=floor(n/2).at n=17A225942
• Numbers with abundancy 4 <= sigma(n)/n < 5.at n=33A230608
• Once a number in this sequence is divisible by all numbers 1 to m, subsequent terms are constrained to have the same property; choose the smallest permissible number that is greater than the previous term.at n=33A242298
• Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=31A249247
• Least k such that d(k*n) = d(n!) (d = A000005).at n=9A274795