80639
domain: N
Appears in sequences
- a(0) = 1, a(1) = 1, a(n+1) = (n+1)*a(n) + n.at n=8A020543
- If n is even, 2(n/2 + 1)! - 1; if n is odd, ((n + 1)/2 + 1)! - 1.at n=13A030494
- Semiprime terms in A136047.at n=18A136048
- Triangle read by rows: (A000012 * A136572 + A136572 * A000012) - A000012.at n=44A136573
- Numbers m such that m mod k is k-1 for all k = 2..9.at n=31A166931
- a(n) = (1+n)*(9 + 11*n + 4*n^2)/3.at n=38A172482
- Smallest number requiring n terms to be expressed as a sum of factorials.at n=29A200748
- a(n) = Sum_{i=0..n} digsum(i)^4, where digsum(i) = A007953(i).at n=29A231689