362889

Appears in sequences

• a(n) = n! + n.at n=9A005095
• Triangle T(n,k) = binomial(n, k)*(k! + (n-k)!), read by rows.at n=46A155162
• Triangle T(n,k) = binomial(n, k)*(k! + (n-k)!), read by rows.at n=53A155162
• Triangle read by rows: T(n,0) = T(n,n) = 1 for n >= 0, T(n,k) = ((n - 1)! + 1)*binomial(n, k) for 1 <= k <= n - 1, n >= 2.at n=46A168621
• Triangle read by rows: T(n,0) = T(n,n) = 1 for n >= 0, T(n,k) = ((n - 1)! + 1)*binomial(n, k) for 1 <= k <= n - 1, n >= 2.at n=53A168621
• Sum of n and the sum of the factorials of its digits.at n=8A241404