cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A151750 #15 Oct 01 2017 10:01:15
%S A151750 0,1,3160
%N A151750 Numbers n such that gcd( binomial(2n,n), 3*5*7*11 ) = 1.
%C A151750 It is conjectured that there are no other terms.
%C A151750 There are no further terms below 10^10000.
%H A151750 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 A151750 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 A151750 nonn,bref
%O A151750 1,3
%A A151750 _N. J. A. Sloane_, Jul 30 2009