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!)
A265401 Numbers n for which gcd{k=1..n-1} binomial(2*n, 2*k) = 1. 2
20, 26, 33, 35, 38, 39, 44, 46, 48, 50, 56, 58, 60, 62, 68, 72, 74, 77, 78, 80, 86, 88, 92, 93, 94, 95, 98, 102, 104, 105, 108, 110, 111, 116, 118, 119, 124, 130, 133, 134, 138, 140, 143, 144, 146, 148, 150, 152, 155, 158, 160, 161, 164, 165, 168, 170, 171, 176, 178, 182, 183, 185, 186, 188, 189, 194, 198, 200 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Contains no primes or prime powers. - Robert Israel, Dec 10 2015
LINKS
MAPLE
select(n -> igcd(seq(binomial(2*n, 2*k), k=1..n-1)) = 1, [$1..200]); # Robert Israel, Dec 10 2015
MATHEMATICA
Select[Range@ 200, GCD @@ Table[Binomial[2 #, 2 k], {k, # - 1}] == 1 &] (* Michael De Vlieger, Dec 09 2015, modified to match the new corrected definition by Antti Karttunen, Dec 11 2015 *)
PROG
(PARI) isok(n) = (n>1) && gcd(vector(n-1, k, binomial(2*n, 2*k))) == 1; \\ Michel Marcus, Dec 08 2015, edited by Antti Karttunen, Dec 11 2015 (see A265388 for why).
CROSSREFS
Cf. A265388.
Sequence in context: A167306 A061840 A252660 * A276503 A067065 A280307
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 08 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)