40575
domain: N
Appears in sequences
- a(n) = n! + 2^n - 1.at n=8A127986
- Triangle read by rows: T(n,k) = Stirling2(n, k+1) + abs(Stirling1(n,k)), 0 <= k <= n.at n=46A152924
- Maximal number of partitions having the same degree in the partition graph G(n) defined at A241150.at n=46A241152
- Number of nX3 0..1 arrays with every element equal to 1, 2, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=7A302523
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=52A302528
- E.g.f.: Sum_{n>=0} (n+1)*(n+2)/2 * x^n * (exp(n*x) + 1)^n / (1 + x*exp(n*x))^(n+3).at n=5A325996
- The denominators of a series that converges to log(2) obtained using Whittaker's root series formula.at n=4A367596