80641

Appears in sequences

• a(n) = 2*n! + 1.at n=8A052898
• Triangle, read by rows, T(n, k) = T(n, k-1) + (k+1)*n!, T(n, 0) = 1.at n=37A105064
• Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (1, 0), (1, 1)}.at n=10A151369
• a(n) = (16^n-3^n)/13.at n=5A180845
• Triangular array read by rows: T(n,k) = n!*k + 1, n >= 1, 1 <= k <= n.at n=29A362777