3628799

Appears in sequences

• If n is even, 2(n/2 + 1)! - 1; if n is odd, ((n + 1)/2 + 1)! - 1.at n=16A030494
• a(n) = n! - 1.at n=10A033312
• Denominators of continued fraction convergents to sqrt(959).at n=8A042857
• a(n) = (n-1)!-n^tau(n)/n^2.at n=9A069152
• T_9(n) in the notation of Bergeron et al., u_k(n) in the notation of Gessel: Related to Young tableaux of bounded height.at n=10A072133
• Triangle read by rows: T(n,k) = n*T(n-1,k) + n - k starting at T(n,n)=0.at n=56A081114
• Triangle read by rows in which the n-th row consists of the first n nonzero terms of A033312.at n=44A105060
• Triangle read by rows in which the n-th row consists of the first n nonzero terms of A033312.at n=53A105060
• a(n)= numerator of ((n + 5)! - (n - 5)!)/(n!).at n=0A127229
• a(n) = (2n)! - 1.at n=4A127230
• Ordered differences of factorials.at n=36A204930
• Number of permutations T(n,k) in S_n containing an increasing subsequence of length k; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=46A214152
• Number of permutations of [n] avoiding adjacent step pattern {up}^9.at n=10A230232
• Least k such that n! + k^2 + k is a perfect square.at n=10A230389
• Triangle T(n,k) giving the largest member of "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k.at n=44A230429
• a(n) = (-1)^n*(n! - (-1)^n).at n=9A235378
• Number of sequences with n copies each of 1,2,...,10 avoiding the pattern 12...10.at n=1A269128
• Number of aperiodic permutation necklaces of weight n.at n=10A306669
• T(n, k) = [n, k] - {n, k}, where [n, k] are the (unsigned) Stirling cycle numbers and {n, k} the Stirling set numbers. Table T(n, k) read by rows, for n >= 3 and 1 <= k <= n-2.at n=36A341102
• Triangle read by rows: T(n, k) = Sum_{i=0..k-2} (-1)^(i+2) * (k-i-1)^n * binomial(k,i).at n=44A366159