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!)
A205009 Least k such that n divides the k-th difference between distinct central binomials coefficients. 1

%I #6 Feb 27 2013 09:44:10

%S 1,3,5,3,2,5,6,9,5,10,28,21,15,6,27,9,8,5,4,27,21,28,7,21,10,15,18,21,

%T 14,27,66,9,28,8,23,40,38,28,36,33,13,21,120,28,40,49,22,21,23,10,18,

%U 44,27,18,45,21,28,14,189,27

%N Least k such that n divides the k-th difference between distinct central binomials coefficients.

%C The ordering of the differences between distinct central binomials coefficients is given by A205008. 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

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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)