OFFSET
1,1
COMMENTS
Original definition: Prime(n)+ Sum(prime(n-z) mod prime(n-z-1)); z=0,1...n-2 ; with offset 2.
Since prime(n+1) < 2*prime(n) for all n, the "mod" in the sum is equivalent to "-", making it telescopic and equal to prime(n)-2. - M. F. Hasler, Jun 29 2013
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Barry Brent, On the constant terms of certain meromorphic modular forms for Hecke groups, arXiv:2212.12515 [math.NT], 2022.
Barry Brent, On the Constant Terms of Certain Laurent Series, Preprints (2023) 2023061164.
FORMULA
a(n) = 2 * prime(n) - 2 = 2 * phi(prime(n)). - Alonso del Arte, Jun 30 2013
a(n) = 2 * A006093(n). - Ray Chandler, Jun 30 2013
EXAMPLE
a(3) = 8 since the third prime is 5 and 2 * 5 - 2 = 8.
MATHEMATICA
2Prime[Range[50]] - 2 (* Alonso del Arte, Jun 30 2013 *)
PROG
(PARI) A037168 = n->prime(n)*2-2 \\ M. F. Hasler, Jun 29 2013
(Magma) [2*p-2: p in PrimesUpTo(300)]; // Vincenzo Librandi, Mar 19 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Armand Turpel (armandt(AT)unforgettable.com)
EXTENSIONS
Definition simplified and extended to n=1, following a suggestion from Alonso del Arte, by M. F. Hasler, Jun 29 2013
STATUS
approved