A139125 a(0) = 0; a(n) = a(n-1) + binomial( n(n+1)/2, n) mod n.

0, 1, 3, 5, 8, 8, 12, 16, 21, 21, 27, 34, 41, 41, 50, 58, 67, 67, 77, 77, 80, 80, 92, 98, 111, 124, 129, 129, 144, 148, 164, 180, 204, 204, 224, 236, 255, 255, 259, 297, 318, 318, 340, 362, 392, 392, 416, 428, 453, 478, 496, 496, 523, 523, 568, 619, 670, 670, 700

Offset: 0

Author

Paolo P. Lava and Giorgio Balzarotti, Apr 08 2008, Apr 14 2008

Keywords

• easy
• nonn

Comments

a(n) = a(n-1)+A137345(n).

Crossrefs

Cf. A137345.

Programs

Maple

P:=proc(n) local a,b,i,k; a:=0; k:=0; for i from 1 by 1 to n do a:=a+i; b:=(binomial(a,i) mod i); k:=k+b; print(k); od; end: P(101);

Mathematica

Rest[RecurrenceTable[{a[0]==0,a[n]==a[n-1]+Mod[Binomial[n (n+1)/2,n], n]}, a,{n,60}]] (* Harvey P. Dale, Dec 14 2011 *)