40696

Appears in sequences

• a(n) = 3*n*a(n-1) + 1, a(0) = 1.at n=5A010845
• Number of right triangles on a (n+1)X8 grid.at n=19A189812
• Number of length n 0..3 arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=7A244898
• T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean.at n=52A244903
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of the e.g.f. exp(x)/(1 - k*x).at n=41A320031
• a(n) is the smallest position in the subtract-a-factorial game for which the value of the Sprague-Grundy function (or nim-value) is n.at n=8A355556
• Triangle read by rows: T(n, k) = n! * 3^k * hypergeom([-k], [-n], 1/3).at n=20A375447