OFFSET
1,1
COMMENTS
There are n distinct successive primes p (not appearing in the sequence) such that a(n) < p < a(n+1). - David James Sycamore, Jul 22 2018
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
Eric Weisstein's World of Mathematics, Triangular Number.
FORMULA
a(n) is asymptotic to (n*(n+1)/2) * log(n*(n+1)/2) = (n*(n+1)/2) * (log(n)+log(n+1)-log(2)) ~ (n^2 + n)*(2 log n)/2 ~ (n^2 + n)*(log n). - Jonathan Vos Post, Mar 12 2006
MAPLE
seq(ithprime(n*(n+1)/2), n=1..50); # Muniru A Asiru, Jul 22 2018
MATHEMATICA
Prime[#]&/@Accumulate[Range[50]] (* Harvey P. Dale, Mar 23 2015 *)
PROG
(Magma) [NthPrime(n*(n+1) div 2): n in [1..100] ]; // Vincenzo Librandi, Apr 11 2011
(Haskell)
a011756 n = a011756_list !! (n-1)
a011756_list = map a000040 $ tail a000217_list
-- Reinhard Zumkeller, Sep 23 2011
(PARI) a(n) = prime(n*(n+1)/2); \\ Michel Marcus, Jul 22 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved