A205011 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A205011

The index j<k such that n divides C(2k-2,k-1)-C(2j-2,j-1), where k is the least index (A205010) for which such j exists.

%I #8 Mar 30 2012 18:58:10

%S 1,2,2,2,1,2,3,3,2,4,7,6,5,3,6,3,2,2,1,6,6,7,1,6,4,5,3,6,4,6,11,3,7,2,

%T 2,4,2,7,8,5,3,6,15,7,4,4,1,6,2,4,3,8,6,3,9,6,7,4,18,6

%N The index j<k such that n divides C(2k-2,k-1)-C(2j-2,j-1), where k is the least index (A205010) for which such j exists.

%C For a guide to related sequences, see A204892.

%t (See the program at A205010.)

%Y Cf. A205010, A204892.

%K nonn

%O 1,2

%A _Clark Kimberling_, Jan 22 2012