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!)
A151750 Numbers n such that gcd( binomial(2n,n), 3*5*7*11 ) = 1. 5

%I

%S 0,1,3160

%N Numbers n such that gcd( binomial(2n,n), 3*5*7*11 ) = 1.

%C It is conjectured that there are no other terms.

%C There are no further terms below 10^10000.

%H R. D. Mauldin, S. M. Ulam, <a href="http://dx.doi.org/10.1016/0196-8858(87)90026-1">Mathematical problems and games</a>, Adv. Appl. Math. 8 (3) (1987) 281-344.

%H C. Pomerance, <a href="https://math.dartmouth.edu/~carlp/catalan5.pdf">Divisors of the middle binomial coefficient</a>, Amer. Math. Monthly, 112 (2015), 636-644.

%K nonn,bref

%O 1,3

%A _N. J. A. Sloane_, Jul 30 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 07:50 EST 2022. Contains 350510 sequences. (Running on oeis4.)