login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139125 a(0) = 0; a(n) = a(n-1) + binomial( n(n+1)/2, n) mod n. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(n) = a(n-1)+A137345(n).
LINKS
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 *)
CROSSREFS
Cf. A137345.
Sequence in context: A272213 A225454 A131977 * A354415 A186697 A077523
KEYWORD
easy,nonn
AUTHOR
Paolo P. Lava and Giorgio Balzarotti, Apr 08 2008, Apr 14 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 10:35 EDT 2024. Contains 372332 sequences. (Running on oeis4.)