30028
domain: N
Appears in sequences
- Number of partitions p of n such that (sum of parts with multiplicity 1) > (sum of all other parts).at n=43A240451
- Number of partitions p of n such that (sum of parts with multiplicity 1) >= (sum of all other parts).at n=43A240452
- The least integer k >= 0 for which A328578(k) = A257993(A276086(A276086(k))) = n.at n=24A328761
- Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a primorial number (A002110).at n=41A353980
- a(n) = phi(prime(n)#-1) where phi is the Euler totient function and p# is the product of all the primes from 2 to p inclusive.at n=5A366810
- a(n) = A108951(n) - A373158(n), where A108951 is fully multiplicative and A373158 is fully additive with a(p) = p# for prime p, where x# is the primorial A034386(x).at n=25A373984
- Numbers k such that A003415(k) == A276085(k) (mod 2310), where A003415 is the arithmetic derivative and A276085 is the primorial base log-function.at n=29A391864