273920
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having exactly k blocks that contain both odd and even entries (0<=k<=floor(n/2)).at n=38A124418
- Product_{n>=1} 1 / (1 - x^n)^(a(n)/n!) = 1 + tan(x).at n=8A354065
- Product_{n>=1} (1 + x^n)^(a(n)/n!) = 1 + tan(x).at n=8A354175
- Irregular triangular array T; row n shows the coefficients of the (n-1)-st polynomial in the obverse convolution s(x)**t(x), where s(x) = x+F(n) and t(x) = x+F(n), and F(n) = n-th Fibonacci number (A000045). See Comments.at n=30A375049