login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137345 a(n) = binomial( n(n+1)/2, n) mod n. 1
0, 1, 2, 2, 3, 0, 4, 4, 5, 0, 6, 7, 7, 0, 9, 8, 9, 0, 10, 0, 3, 0, 12, 6, 13, 13, 5, 0, 15, 4, 16, 16, 24, 0, 20, 12, 19, 0, 4, 38, 21, 0, 22, 22, 30, 0, 24, 12, 25, 25, 18, 0, 27, 0, 45, 51, 51, 0, 30, 0, 31, 0, 35, 32, 35, 0, 34, 0, 33, 10, 36, 0, 37, 0, 39, 57, 14, 0, 40, 12, 5, 0, 42, 40 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..84.

FORMULA

a(n) = A014068(n) mod n. - R. J. Mathar, Apr 09 2008

MAPLE

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

CROSSREFS

Cf. A139125.

Sequence in context: A095201 A272143 A095058 * A060755 A104594 A079626

Adjacent sequences:  A137342 A137343 A137344 * A137346 A137347 A137348

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 12:34 EDT 2019. Contains 322209 sequences. (Running on oeis4.)