OFFSET
0,1
COMMENTS
First differences of A034953 for n > 0. - Gionata Neri, May 17 2015
FORMULA
a(n) = (prime(n+1)-prime(n))*(prime(n+1)+prime(n)+1)/2 for n >= 1. - N. J. A. Sloane, May 08 2008
EXAMPLE
3 = 1 + 2;
3 = 3;
9 = 4 + 5;
13 = 6 + 7;
38 = 8 + 9 + 10 + 11;
...
MAPLE
3, seq((ithprime(n+1)-ithprime(n))*(ithprime(n+1)+ithprime(n)+1)/2, n=1..100); # Robert Israel, May 17 2015
MATHEMATICA
Join[{3}, Table[(Prime[n+1] - Prime[n]) (Prime[n+1] + Prime[n] + 1)/2, {n, 60}]] (* Vincenzo Librandi, May 18 2015 *)
Join[{3}, (#[[2]]-#[[1]]) (Total[#]+1)/2&/@Partition[Prime[Range[ 60]], 2, 1]] (* Harvey P. Dale, Oct 27 2020 *)
PROG
(Magma) [3] cat [(NthPrime(n+1) - NthPrime(n))*(NthPrime(n+1) + NthPrime(n)+1)/2: n in [1..60]]; // Vincenzo Librandi, May 18 2015
(Python)
from sympy import prime, nextprime
def A138383(n):
if n == 0: return 3
q = nextprime(p:=prime(n))
return (q-p)*(p+q+1)>>1 # Chai Wah Wu, Jun 01 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Odimar Fabeny, May 08 2008
STATUS
approved