This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059288 a(n) = binomial(2*n,n) mod n. 8

%I

%S 0,0,2,2,2,0,2,6,2,6,2,4,2,6,0,6,2,6,2,0,6,6,2,12,2,6,20,0,2,4,2,6,9,

%T 6,7,16,2,6,20,20,2,0,2,4,0,6,2,12,2,6,3,44,2,6,32,32,39,6,2,36,2,6,

%U 12,6,5,0,2,36,66,40,2,36,2,6,45,32,0,66,2,20,20,6,2

%N a(n) = binomial(2*n,n) mod n.

%H T. D. Noe, <a href="/A059288/b059288.txt">Table of n, a(n) for n=1..5000</a>

%F a(n) = Catalan(n) mod n. - _Jonathan Sondow_, Dec 13 2013

%p binomial(2*n,n) mod n;

%p seq(irem(binomial(2*n,n),n),n=1..83); - _Zerinvary Lajos_, Apr 20 2008

%t Table[Mod[Binomial[2*n, n], n], {n, 1, 25}] (* _G. C. Greubel_, Jan 04 2017 *)

%o (PARI) { for (n = 1, 5000, write("b059288.txt", n, " ", binomial(2*n, n) % n); ) } \\ _Harry J. Smith_, Jun 25 2009

%Y Cf. A053214, A059289, A000108.

%K nonn

%O 1,3

%A _N. J. A. Sloane_, Jan 25 2001

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.

Last modified January 20 14:40 EST 2019. Contains 319333 sequences. (Running on oeis4.)