reviewed
approved
proposed
reviewed
editing
proposed
a(n) = is the smallest number k with prime sum of divisors such that tau(k) = n-th prime.
proposed
editing
editing
proposed
A278913[n_] := BlockNestWhile[{x = NextPrime, 2}, While[, ! PrimeQ[Cyclotomic[Prime[n], x]#], x = NextPrime[x] &]; x^(Prime[n] - 1)] (* Davin Park, Dec 08 28 2016 *)
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed