97287
domain: N
Appears in sequences
- a(n) = Sum_{j=0..n} Sum_{i=0..n} T(j,i), T given by A026736.at n=15A026745
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .at n=47A186754
- First differences of A325056: distance in A076042 from n-th low point to the next.at n=19A324792