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!)
 A256277 C(2*n,n) mod 2*n+1. 1
 2, 1, 6, 7, 10, 1, 12, 1, 18, 19, 22, 6, 11, 1, 30, 9, 15, 1, 15, 1, 42, 15, 46, 29, 36, 1, 27, 55, 58, 1, 14, 19, 66, 21, 70, 1, 32, 35, 78, 43, 82, 40, 60, 1, 7, 60, 70, 1, 18, 1, 102, 96, 106, 1, 39, 1, 17, 96, 3, 111, 84, 31, 126, 84, 130, 37, 30, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) == (-1)^n (mod 2*n+1) if 2*n+1 is prime or is in A163209. a(n) = 0 for n in A073076. LINKS Robert Israel, Table of n, a(n) for n = 1..10000 MAPLE seq(binomial(2*n, n) mod (2*n+1), n=1..100); # Robert Israel, Jun 12 2015 MATHEMATICA Table[Mod[Binomial[2 n, n], 2 n + 1], {n, 200}] (* Vincenzo Librandi, May 03 2016 *) PROG (MAGMA) [Binomial(2*n, n) mod (2*n+1): n in [1..70]]; // Vincenzo Librandi, May 03 2016 CROSSREFS Cf. A000984, A001405, A059288, A053214, A073076, A163209. Sequence in context: A324037 A160348 A047708 * A252746 A182883 A172285 Adjacent sequences:  A256274 A256275 A256276 * A256278 A256279 A256280 KEYWORD nonn AUTHOR Robert Israel, Jun 12 2015 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 30 16:16 EDT 2020. Contains 333127 sequences. (Running on oeis4.)