66150

Appears in sequences

• Denominator of 2^n*(3*n-3)!/( ((n-1)!)^3 * (2*n)! ).at n=7A004824
• a(n) = n^2*(5*n-3)/2.at n=30A006597
• Partial sums of n 3-spaced triangular numbers beginning with t(2), e.g., a(2) = t(2) + t(5) = 3 + 15 = 18.at n=34A085789
• Numerators of coefficients of series expansion of 1/(Bernoulli trial entropy), scaled to denominators A091137.at n=34A145178
• Triangle read by rows: T(n,k) is the number of fixed-point-free involutions of {1,2,...,2n} having k cycles with entries of opposite parities (0 <= k <= n).at n=31A161119
• Triangle read by rows: T(n,k) is the number of fixed-point-free involutions of {1,2,...,2n} having k cycles with entries of the same parity (0 <= k <= 2*floor(n/2)).at n=29A161121
• Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.at n=27A166814
• Numbers with prime factorization p*q^2*r^2*s^3 (where p, q, r, s are distinct primes).at n=29A190109
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals five times the largest prime divisor of k.at n=29A212863
• Triangle read by rows: labeled trees counted by improper edges.at n=26A217922
• Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=45A249247
• Number of nX2 arrays containing 2 copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.at n=7A267625
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.at n=43A267629
• a(n) = A059897(A260443(n), A260443(1+n)).at n=19A284577
• a(1) = 0; for n > 1, a(n) = Product_{d|n, d>1, d<n} prime(1+A297167(d)).at n=47A324193
• a(n) = Product_{d|n} A019565(d)^A010051(n/d).at n=29A329352
• a(n) is the least number with exactly n odd divisors that are <= sqrt(n).at n=20A334853
• a(n) is the denominator of Sum_{k=1..n} 1 / (k*k!).at n=6A354401
• Expansion of e.g.f. exp( x * (exp(x^2/2) - 1) ).at n=10A375591
• Triangle read by rows: T(n,k) is the number of achiral combinatorial maps with n edges and genus k, 0 <= k <= floor(n/2).at n=28A380234