79209

Appears in sequences

• Numerators of continued fraction convergents to sqrt(381).at n=8A041722
• Operation count 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. Sequence gives number of comparisons required to find j in step L2.2'.at n=6A079750
• Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i.at n=39A121662
• Triangle read by rows: T(m,n) = Sum_{i=1..n} P(m,i) where P(m,n) = m!/(m-n)! is the number of permutations of m items taken n at a time, for 1 <= n <= m.at n=41A285268
• Let a(0)=1. Then a(n) = sums of consecutive strings of positive integers of length 3*n, starting with the integer 2.at n=26A289721
• Expansion of H(x)*(1+x^5)/(1-x^2-x^3-x^4) where H(x) = g.f. for A249665.at n=17A337654