Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139125
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139125 a(0) = 0; a(n) = a(n-1) + binomial( n(n+1)/2, n) mod n. +0
2
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; listen)
OFFSET

0,3

COMMENT

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

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);

CROSSREFS

Cf. A137345.

Sequence in context: A081859 A046086 A131977 this_sequence A077523 A107820 A064186

Adjacent sequences: A139122 A139123 A139124 this_sequence A139126 A139127 A139128

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Apr 08 2008, Apr 14 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research