The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A265403 Numbers n for which gcd{k=1..n-1} binomial(2*n, 2*k) = 2n-1. 3
10, 12, 21, 22, 24, 30, 34, 36, 40, 51, 52, 55, 57, 69, 70, 76, 82, 84, 87, 90, 96, 99, 100, 106, 112, 114, 115, 117, 120, 129, 132, 136, 141, 142, 147, 154, 156, 159, 166, 174, 177, 180, 184, 187, 192, 195, 201, 205, 210, 216, 217, 220, 222, 225, 231, 232, 234, 240, 244, 246, 250, 252, 255, 261, 262, 274, 279, 282, 285, 286, 294, 297, 300 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
Select[Range@ 300, GCD @@ Array[Function[k, Binomial[2 #, 2 k]], {# - 1}] == 2 # - 1 &] (* Michael De Vlieger, Dec 11 2015 *)
PROG
(PARI) isok(n) = (n>1) && gcd(vector(n-1, k, binomial(2*n, 2*k))) == 2*n-1; \\ Michel Marcus, Dec 08 2015, edited by Antti Karttunen, Dec 11 2015 (see A265388 for why).
CROSSREFS
Cf. A265388.
Cf. also A265402.
Sequence in context: A186438 A346678 A035284 * A215940 A368550 A337866
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 June 7 11:15 EDT 2024. Contains 373172 sequences. (Running on oeis4.)