OFFSET
1,2
COMMENTS
Firoozbakht conjecture: a(n) > 0 for all n. Let b(n) = a(n+1) - a(n). Conjecture: c(n) = b(n+1) - b(n) > 0 for all n. - Thomas Ordowski, May 07 2013
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..301
A. Kourbatov, Verification of the Firoozbakht conjecture for primes up to four quintillion, arXiv preprint arXiv:1503.01744 [math.NT], 2015
A. Kourbatov, Upper bounds for prime gaps related to Firoozbakht's conjecture, J. Int. Seq. 18 (2015) 15.11.2
MATHEMATICA
Table[Prime[n]^(n+1) - Prime[n+1]^n, {n, 20}] (* T. D. Noe, May 03 2012 *)
PROG
(Magma) [NthPrime(n)^(n+1)-NthPrime(n+1)^n: n in [1..19]]; // Vincenzo Librandi, Nov 16 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Thomas Ordowski, May 03 2012
STATUS
approved