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!)
A101681 Numbers k such that gcd (C(2k,k), 2k+1) > 1. 2

%I #11 Apr 03 2021 22:02:08

%S 7,16,17,19,22,25,31,34,38,42,43,45,46,47,49,52,55,58,61,64,67,70,71,

%T 72,73,76,77,79,80,82,87,88,92,93,94,97,100,102,103,104,106,107,110,

%U 112,115,117,122,123,124,127,129,130,133,136,139,142,143,145,147,148

%N Numbers k such that gcd (C(2k,k), 2k+1) > 1.

%C Positions where A056616 differs from A000984.

%C The set seems to have greater cardinality than its complement.

%H David A. Corneth, <a href="/A101681/b101681.txt">Table of n, a(n) for n = 1..10000</a>

%e 7 is in the sequence as gcd(binomial(2*7, 7), 2*7 + 1)) = gcd(3432, 15) = gcd(3*1144, 3*5) > 1. - _David A. Corneth_, Apr 03 2021

%t Select[Range[200],GCD[Binomial[2 #,#],2 #+1]>1&] (* _Harvey P. Dale_, May 11 2019 *)

%o (PARI) is(n) = { my(f = factor(2*n+1)); for(i = 1, #f~, if(val(2*n, f[i, 1])-2*val(n, f[i, 1]) > 0, return(1))); 0 }

%o val(n, p) = my(r=0); while(n, r+=n\=p); r \\ _David A. Corneth_, Apr 03 2021

%Y Cf. A000984, A056616, A126786.

%K nonn

%O 1,1

%A _Ralf Stephan_, Dec 11 2004

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)