-8190

Appears in sequences

• Expansion of Product_{k>=1} (1 - x^k)^15.at n=11A010822
• Triangle read by rows giving the coefficients of general sum formulas of n-th Subfactorial numbers (A000166). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k-1, where T(i,k) satisfies Subf(n) = Sum_{k=1..n} Sum_{i=1..2*k-1} T(i,k) * C(n-k,i-1) * n^(n-k).at n=34A101560
• a(0)=1, a(n) = 2 - 2^(n-1) for n>0.at n=14A122958
• a(0) = 1, a(n) = (-1)^n*(2-2^(n-1)) for n>0.at n=14A122959
• A(n,k,m) is the number of permutations of an n-set with k disjoint cycles of length less than or equal to m, called the (n,k)-th m-restrained Stirling numbers of the first kind, and denoted by mS_1(n,k). The sequence shows the case of m=3.at n=51A171996
• Write x/(1-x) in the form Sum_{j>=1} a(j)*x^j/(1+a(j)*x^j).at n=25A290971