149904

Appears in sequences

• a(n) = n!*(1 + Sum_{i=1..n} 1/i).at n=8A000774
• Difference of the first two Stirling numbers of the first kind.at n=8A081046
• Generalized Stirling numbers of the first kind.at n=8A081049
• Generalized Stirling numbers of the first kind.at n=8A081050
• Triangle of coefficients of certain polynomials used with prime numbers as variables in the computation of the array A103728.at n=36A103718
• a(n) = Sum_{k=0..n} 6^k*A111146(n,k).at n=5A113331
• Number of distinct values of the sum of 5 products of three 0..n integers.at n=31A225262
• a(n) = n*(16*n^2 - 21*n + 7)/2.at n=27A260260
• Triangle read by rows: T(n,k) = (n-k-1+H(k+1))*((k+1)!) for 0 <= k <= n where H(k+1) = Sum_{i=0..k} 1/(i+1) for k >= 0.at n=52A336746
• Numbers that are the sum of three positive cubes in four or more ways.at n=18A343968
• Numbers that are the sum of three positive cubes in exactly 4 ways.at n=18A343969
• Array read by ascending antidiagonals: A(n, k) is the number of (n, k)-poly-Cauchy permutations.at n=46A344639
• Triangle read by rows, T(n, k) = Sum_{j=0..k} |Stirling1(n, j)|.at n=47A349782
• Irregular triangle read by rows: T(n,k) is the number of n-permutations whose third-longest cycle has length exactly k; n >= 0, 0 <= k <= floor(n/3).at n=18A350015
• Irregular triangle read by rows: T(n,k) is the number of n-permutations whose third-shortest cycle has length exactly k; n >= 0, 0 <= k <= max(0,n-2).at n=30A350016
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / ( (1-x) * (1-y) * (1 - log(1-x) * log(1-y)) ).at n=46A382823
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] 1 / ( (1-x) * (1-y) * (1 - log(1-x) * log(1-y)) ).at n=53A382823
• Square array A(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of e.g.f. Sum_{j>=0} (j+1)^k * (-log(1-x))^j / j!.at n=53A383064
• Array read by downward antidiagonals: T(n,k) is the number of partitions of [n], n >= 1, k >= 1, into cycles labeled with positive integers, such that the labels sum to k.at n=53A388788