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

3, 3, 10, 35, 35, 462, 10, 35, 10, 1716, 1716, 462, 126, 462, 1716, 35, 35, 24310, 1716, 6435, 462, 1716, 92378, 462, 35, 24310, 462, 462, 126, 1716, 352716, 35, 1716, 35, 1716, 24310, 24310, 1716, 6435, 6435, 126, 462, 77558760, 24310, 24310

Offset

1,1

Comments

For a guide to related sequences, see A204892.

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Maple

N:= 100: # for a(1)..a(N)
S:=proc(j) option remember; binomial(2*j, j)/2 end proc:
A:= Vector(N): T:= {$1..N}:
for k from 2 while T <> {} do
  for j from 1 to k-1 while T <>{} do
    w:= S(k)-S(j);
    d:= select(t -> w mod t = 0, T);
    A[convert(d, list)]:= S(k);
    T:= T minus d;
  od;
od;
convert(A, list); # Robert Israel, Aug 28 2019

Mathematica

(See the program at A205386.)

Crossrefs

Cf. A205386, A204892.

Sequence in context: A019168 A107299 A298899 * A121446 A302196 A340598

Adjacent sequences: A205385 A205386 A205387 * A205389 A205390 A205391

Keyword

nonn

Author

Clark Kimberling, Jan 27 2012

Status

approved