login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

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
0, 1, 3160 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

It is conjectured that there are no other terms.

There are no further terms below 10^10000.

REFERENCES

Mauldin, R. Daniel; Ulam, S. M.; Mathematical problems and games. Adv. in Appl. Math. 8 (1987), 281-344.

C. Pomerance, Divisors of the middle binomial coefficient, Amer. Math. Monthly, 112 (2015), 636-644.

LINKS

Table of n, a(n) for n=1..3.

CROSSREFS

Sequence in context: A252215 A250760 A184452 * A252636 A068266 A140350

Adjacent sequences:  A151747 A151748 A151749 * A151751 A151752 A151753

KEYWORD

nonn,bref

AUTHOR

N. J. A. Sloane, Jul 30 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 28 16:24 EDT 2017. Contains 287241 sequences.