32741
domain: N
Appears in sequences
- a(0) = 1; a(n) = Sum_{0 <= k < n and gcd(k,n) = 1} a(k).at n=20A045545
- Numbers k such that 10^k - prime(k) is prime.at n=8A110066
- Monotonic ordering of nonnegative differences 8^i-3^j, for 40>= i>=0, j>=0.at n=27A192156
- a(n) = 2^n - 27.at n=15A220087
- Numbers n such that n!3 - 3^5 is prime.at n=35A247465
- a(n) = [x^n] exp(Sum_{k>=1} (-1)^(k+1)*x^k*(1 + (n - 3)*x^k)/(k*(1 - x^k)^3)).at n=9A318124
- MM-numbers of crossing, capturing multiset partitions (with empty parts allowed).at n=15A326259
- Number of ways to select 3 or more collinear points from a 4 X n grid.at n=12A355552
- a(n) is the smallest k such that k!'s prime(n)-smooth part is less than its prime(n+1)-rough part.at n=40A360316