41066

Appears in sequences

• a(n) = Sum_{k=1..n} (2*k)!.at n=3A138524
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=11A148234
• Sequence is obtained from Catalan numbers (A000108) by taking the factorial of each digit and adding them up.at n=9A165163
• Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) ( n + 2(i-1) )!at n=13A211368
• Least number k such that A304036(k) = n.at n=33A304039
• Number of occurrences of k in the list of transitions t(j), j <= n!-1, of interchanges a(t(j)) <-> a(t(j)+1) created by Knuth's "Algorithm T" (Plain change transitions) to generate all permutations of n distinct elements, written as a triangle T(m,k), m = n-1 >= 1, k <= m.at n=28A321668
• Partial sums of A005165.at n=8A341900