The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059289 a(n) = 1 + (binomial(2n,n) mod n). 3
 1, 1, 3, 3, 3, 1, 3, 7, 3, 7, 3, 5, 3, 7, 1, 7, 3, 7, 3, 1, 7, 7, 3, 13, 3, 7, 21, 1, 3, 5, 3, 7, 10, 7, 8, 17, 3, 7, 21, 21, 3, 1, 3, 5, 1, 7, 3, 13, 3, 7, 4, 45, 3, 7, 33, 33, 40, 7, 3, 37, 3, 7, 13, 7, 6, 1, 3, 37, 67, 41, 3, 37, 3, 7, 46, 33, 1, 67, 3, 21, 21, 7, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Harry J. Smith, Table of n, a(n) for n = 1..5000 MAPLE [seq((binomial(2*n, n) mod (n))+1, n=1..50)]; MATHEMATICA 1 + Table[Mod[Binomial[2*n, n], n], {n, 1, 25}] (* G. C. Greubel, Jan 04 2017 *) PROG (PARI) { for (n = 1, 5000, write("b059289.txt", n, " ", 1 + binomial(2*n, n) % n); ) } \\ Harry J. Smith, Jun 25 2009 CROSSREFS Cf. A053214, A059288. Sequence in context: A181520 A256736 A123073 * A201277 A163644 A290348 Adjacent sequences:  A059286 A059287 A059288 * A059290 A059291 A059292 KEYWORD nonn AUTHOR N. J. A. Sloane, Jan 25 2001 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.

Last modified March 29 05:39 EDT 2020. Contains 333105 sequences. (Running on oeis4.)