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

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

Offset: 1

Author

N. J. A. Sloane, Jan 25 2001

Keywords

• nonn

Links

• Harry J. Smith, Table of n, a(n) for n = 1..5000

Crossrefs

Cf. A053214, A059288.

Programs

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 *)

PARI

{ for (n = 1, 5000, write("b059289.txt", n, " ", 1 + binomial(2*n, n) % n); ) } \\ Harry J. Smith, Jun 25 2009