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!)
A137345 a(n) = binomial( n(n+1)/2, n) mod n. 1

%I #4 Aug 24 2012 10:50:00

%S 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,

%T 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,

%U 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

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

%F a(n) = A014068(n) mod n. - _R. J. Mathar_, Apr 09 2008

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

%Y Cf. A139125.

%K easy,nonn

%O 1,3

%A _Paolo P. Lava_ and _Giorgio Balzarotti_, Apr 08 2008, Apr 14 2008

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 April 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)