OFFSET
2,1
COMMENTS
LINKS
Robert G. Wilson v, Table of n, a(n) for n = 2..66 (first 49 terms from Davin Park)
FORMULA
a(n) = A101636(n)^(prime(n)-1). - Davin Park, Dec 10 2016
EXAMPLE
a(2) = 9 because 9 is the smallest odd number with prime values of sum of divisors (sigma(9) = 13) such that tau(9) = 3 = 2nd prime.
MATHEMATICA
A278914[n_] := NestWhile[NextPrime, 3, ! PrimeQ[Cyclotomic[Prime[n], #]] &]^(Prime[n] - 1); Array[A278914, 10, 2] (* Davin Park, Dec 28 2016 *)
PROG
(Magma) A278914:=func<n|exists(r){k:k in[1..10000000] | IsOdd(k) and IsPrime(SumOfDivisors(k)) and NumberOfDivisors(k) eq NthPrime(n)} select r else 0>; [A278914(n): n in[2..6]]
(PARI) a(n) = {my(k=1); while(! (isprime(sigma(k)) && isprime(p=numdiv(k)) && (primepi(p) == n)), k+=2); k; } \\ Michel Marcus, Dec 03 2016
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jaroslav Krizek, Nov 30 2016
EXTENSIONS
More terms from Davin Park, Dec 11 2016
STATUS
approved