29990
domain: N
Appears in sequences
- a(n) = floor(n! / n^3).at n=10A242426
- Smallest even number k such that lpf(k-3) = prime(n) while lpf(k-1) > lpf(k-3), where lpf=least prime factor (A020639).at n=35A242490
- Number of inversion sequences avoiding pattern 201 (or 210).at n=8A263777
- G.f. A(x) satisfies: A(x) = 1 + x + x^2 + x^3*A(x)^2.at n=22A307970
- Expansion of (-1 + Product_{k>=1} 1 / (1 + (-x)^k))^5.at n=23A341244