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!)
A205012 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=C(2j-2,j-1). 2

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

%S 2,6,20,6,6,20,20,70,20,70,3432,924,252,20,3432,70,70,20,20,3432,924,

%T 3432,70,924,70,252,924,924,252,3432,705432,70,3432,70,3432,48620,

%U 48620,3432,12870,12870,252,924,155117520,3432,48620,184756,3432

%N Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=C(2j-2,j-1).

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

%t (See the program at A205010.)

%Y Cf. A205010, A204892.

%K nonn

%O 1,1

%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 June 25 13:13 EDT 2024. Contains 373705 sequences. (Running on oeis4.)