154440

Appears in sequences

• a(n) = (7*n+3)*(7*n+5)*(7*n+6).at n=7A001561
• a(n) = (n+8)!/8!.at n=5A049389
• Product of 5 consecutive integers.at n=13A052787
• E.g.f.: x^5*exp(x)-x^5.at n=13A052800
• Bessel polynomial {y_n}'''(0).at n=10A065949
• a(n) = smallest (n+1)(n+2)...(n+k) that is >= n!.at n=7A075358
• Numbers that can be expressed as the difference of the squares of primes in exactly eight distinct ways.at n=30A092004
• a(n) is the number of digraphs (not allowing loops) with vertices 1,2,...,n that have a unique Eulerian tour (up to cyclic shift).at n=5A102693
• a(n) = F(n+1)!/F(n)! where F(n) = n-th Fibonacci number.at n=5A110372
• Triangle read by rows: number of order-preserving partial transformations (of an n-element chain) of width and waist both equal to r (width(alpha) = |Dom(alpha)| and waist(alpha) = max(Im(alpha))).at n=63A110858
• Triangle read by rows: T(n,k) = k!*binomial(n+k-1,k) (n >= 0, 0 <= k <= n), rising factorial power, Pochhammer symbol.at n=50A124320
• Triangle T(n, k) = 2*n*binomial(2*n-k, k)*(n-k)!/(2*n-k), with T(0, 0) = 2, read by rows.at n=49A156995
• Triangle T(n,k) read by rows: number of k-lists (ordered k-sets) of disjoint 2-subsets of an n-set, n>1, 0<k<=floor(n/2).at n=38A157018
• Numbers with prime factorization pqrs^3t^3.at n=4A190385
• Number of nX5 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor.at n=2A221084
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor.at n=23A221087
• Number of 3 X n arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor.at n=4A221089
• Number of permutations of [n] beginning with at least ceiling(n/2) ascents.at n=13A262034
• Triangle read by rows, the denominators of the Bell transform of B(2n,1) where B(n,x) are the Bernoulli polynomials.at n=59A265603
• Least number, m, such that m^2 is expressible in just n ways as (p+1)(q+1) where p and q are distinct primes.at n=57A274877