OFFSET
1,1
COMMENTS
If p is a prime then a(p) = prime(p)*T(p), where T(p) = the p-th triangular number.
PROG
(PARI) for(i=1, 120, p=prime(i); s=p*((i-1)*(i))/2; t=sum(k=1, i-1, p*k); k=i; while(denominator((s+k*p)/i)>1, k++); t+=k*p; print1(t, ", ")) (Herrgesell)
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Apr 26 2003
EXTENSIONS
More terms from Lambert Herrgesell (zero815(AT)googlemail.com), Dec 30 2005
STATUS
approved