866250

Appears in sequences

• Second-order reciprocal Stirling number (Fekete) a(n) = [[2n+2, n]]. The number of n-orbit permutations of a (2n+2)-set with at least 2 elements in each orbit. Also known as associated Stirling numbers of the first kind (e.g., Comtet).at n=4A000907
• Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 2, 1 <= k <= floor(n/2)).at n=34A008306
• Denominators of n divided by the product of the anti-divisors of n.at n=35A093396
• Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 0 and 0 <= k <= floor(n/2)).at n=47A106828
• a(n) is the smallest number m such that the first n primes are all distinct prime divisors of m and for i=1,2,...,n prime(i)*m+1 is prime.at n=4A112724
• a(n) is the Severi degree for curves of degree n and cogenus 2.at n=21A171108
• Triangle read by rows of products of Stirling numbers of the second kind (A008277): a(n,k) = S(n,k) S(n+1,k+1).at n=63A187557
• Triangle read by rows, giving coefficients in an expansion of absolute values of Stirling numbers of the first kind in terms of binomial coefficients.at n=25A259456
• Values of |G-hat_2(n)|, a sum involving Stirling numbers of the second kind.at n=7A261899
• Triangle read by rows, T(n, k) = Sum_{m=0..k} (-1)^(m + k)*binomial(n + k, n + m) * |Stirling1(n + m, m)|, for n >= 0, 0 <= k <= n.at n=33A269940
• Triangle read by rows: T(n,k) is the number of edge covers of the complete labeled graph on n nodes that are minimal and have exactly k edges, n>=2, 1<=k<=n-1.at n=51A281269