login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A318199
a(n) is the largest integer m such that m^n <= n^prime(n).
2
1, 2, 6, 11, 34, 48, 112, 139, 274, 794, 860, 2125, 3259, 3313, 4842, 9741, 18637, 17946, 32306, 41558, 39471, 66148, 82046, 131305, 265464, 313781, 288660, 339008, 313761, 366288, 1287573, 1451134, 2014343, 1824089, 3743848, 3371509, 4510880, 5976406
OFFSET
1,2
COMMENTS
The sequence is not monotonic, for example a(18) < a(17).
Conjecture: there is no run of consecutive increasing terms with more than 17 terms.
LINKS
FORMULA
a(n) = floor(n^(prime(n)/n)).
a(n) = floor(A062481(n)^(1/n)).
MAPLE
Digits:= 2000:
a:= n-> floor(n^(ithprime(n)/n)):
seq(a(n), n=1..40); # Muniru A Asiru, Sep 17 2018
MATHEMATICA
a[n_]:=Floor[n^(Prime[n]/n)]; Array[a, 40]
PROG
(PARI) a(n) = sqrtnint(n^prime(n), n); \\ Michel Marcus, Mar 12 2020
vector(40, n, a(n))
CROSSREFS
KEYWORD
nonn
AUTHOR
Stefano Spezia, Aug 21 2018
STATUS
approved