Conjectured maximum value k such that n = ceiling(prime(k)^(1+1/k)) - prime(k+1), or 0 if none such.
4, 3, 6, 9, 8, 30, 7, 15, 16, 18, 217, 34, 46, 47, 66, 32, 99, 61, 0, 154, 189, 97, 82, 263, 3385, 150, 205, 429, 297, 462, 344, 590, 375, 738, 295, 3644, 757, 574, 31545, 928, 2810, 1879, 4522, 40933, 4612, 1663, 149689, 4260, 2344, 2524
1
This was computed using the first 10^8 primes; that is, primes up to 2038074743.
T. D. Noe, Plot of 50 terms
Alexei Kourbatov, Verification of the Firoozbakht conjecture for primes up to four quintillion, arVix 1503.01744 (Mar 05 2015)
Wikipedia, Firoozbakht's conjecture
(Mma) nn = 50; t2 = Table[0, {nn}]; Do[s = Ceiling[Prime[n]^(1 + 1/n)] - Prime[n + 1]; If[s <= nn, t2[[s]] = n], {n, 10^6}]; t2
nonn
T. D. Noe, Mar 07 2015