32374
domain: N
Appears in sequences
- Numbers k such that k^14 == 1 (mod 15^3).at n=38A056087
- p-INVERT of the Fibonacci sequence (A000045), where p(S) = (1 - S)^2.at n=10A292327
- a(n) = Sum_{k=1..n} phi(k)*phi(k+1)*phi(k+2), where phi(k) = A000010(k) is Euler's totient function.at n=26A335131
- Numbers k such that A003415(k) >= A276086(k) and gcd(k, A003415(k)) = gcd(k, A276086(k)), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.at n=46A369959
- Numbers k such that A276086(k)-1 or A276086(k)+1 is a perfect power (A001597), where A276086 is the primorial base exp-function.at n=37A379960
- Numbers k such that A276086(k)+1 is a perfect power (A001597), where A276086 is the primorial base exp-function.at n=21A379962
- Numbers k such that A276086(k)+1 is a perfect square (A000290), where A276086 is the primorial base exp-function.at n=16A379963
- Number of integer partitions of n having a permutation with all equal run-lengths.at n=41A383013