OFFSET
1,1
COMMENTS
LINKS
Davin Park, Table of n, a(n) for n = 1..50
FORMULA
a(n) = A123487(n)^(prime(n)-1). - Davin Park, Dec 10 2016
EXAMPLE
a(3) = 16 because 16 is the smallest number with prime values of sum of divisors (sigma(16) = 31) such that tau(16) = 5 = 3rd prime.
MATHEMATICA
A278913[n_] := NestWhile[NextPrime, 2, ! PrimeQ[Cyclotomic[Prime[n], #]] &]^(Prime[n] - 1) (* Davin Park, Dec 28 2016 *)
PROG
(Magma) A278913:=func<n|exists(r){k:k in[1..10000000] | IsPrime(SumOfDivisors(k)) and NumberOfDivisors(k) eq NthPrime(n)} select r else 0>; [A278913(n): n in[1..8]]
(PARI) a(n) = {my(k=1); while(! (isprime(sigma(k)) && isprime(p=numdiv(k)) && (primepi(p) == n)), k++); k; } \\ Michel Marcus, Dec 03 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Nov 30 2016
EXTENSIONS
More terms from Davin Park, Dec 08 2016
STATUS
approved