The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A137345 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A137345

a(n) = binomial( n(n+1)/2, n) mod n.
(history; published version)

#4 by Charles R Greathouse IV at Fri Aug 24 10:50:00 EDT 2012

AUTHOR

_Paolo P. Lava & _ and _Giorgio Balzarotti (paoloplava(AT)gmail.com), _, Apr 08 2008, Apr 14 2008

Discussion

Fri Aug 24

10:50

OEIS Server: https://oeis.org/edit/global/1825

#3 by Russ Cox at Fri Mar 30 17:39:31 EDT 2012

FORMULA

a(n) = A014068(n) mod n. - _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Apr 09 2008

Discussion

Fri Mar 30

17:39

OEIS Server: https://oeis.org/edit/global/190

#2 by T. D. Noe at Wed Sep 28 20:49:54 EDT 2011

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (pplpaoloplava(AT)splgmail.atcom), Apr 08 2008, Apr 14 2008

Discussion

Wed Sep 28

20:49

OEIS Server: https://oeis.org/edit/global/96

#1 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

NAME

a(n) = binomial( n(n+1)/2, n) mod n.

DATA

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

OFFSET

1,3

FORMULA

a(n) = A014068(n) mod n. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 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.

KEYWORD

easy,nonn

AUTHOR

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

STATUS

approved