524296

Appears in sequences

• a(n) = (n/2)*(n^4 + 1).at n=16A021003
• Solutions to phi(gpf(x)) - gpf(phi(x)) = 65534 = c are special multiples of 65537, x=65537*k, where the largest prime factors of factor k were observed in {2, 3, 5, 17, 257}.at n=6A070816
• Numbers k such that phi(k) is a perfect 9th power.at n=15A078169
• Unitary sigma-unitary phi super perfect numbers: USUP(USUP(n))= n/k for some integer k.at n=47A093863
• a(n) = (A102371(n) + n)/2.at n=19A103745
• a(n) = n^2*(n^8+1)/2.at n=4A168126
• a(n) = 8*(2^n + 1).at n=16A175161
• Number of 0..4 colorings on an nX3 array circular in the 3 direction with new values 0..4 introduced in row major order.at n=4A214135
• T(n,k)=Number of 0..4 colorings of an nx(k+1) array circular in the k+1 direction with new values 0..4 introduced in row major order.at n=19A214141
• Number of 0..4 colorings of a 5X(n+1) array circular in the n+1 direction with new values 0..4 introduced in row major order.at n=1A214146
• a(n) = 2^n + 8.at n=19A242475
• Numbers n such that sigma(n) - 1 and sigma(phi(n)) are both primes.at n=29A270416
• Numbers k such that usigma(uphi(k)) = k where usigma is the sum of unitary divisors of k (A034448) and uphi is the unitary totient function (A047994).at n=41A329856
• a(n) = Sum_{k=1..n} phi(gcd(k, n))^(n-1).at n=9A342540