94839

Appears in sequences

• Number of index tests required to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2.at n=6A079885
• Number of (weakly) unimodal compositions of n where all parts 1, 2, ..., m appear where m is the largest part.at n=35A227038