A205013 The number s(j)=C(2j-2,j-1) such that n divides s(k)-s(j)>0, where k is the least positive integer for which such a j exists.

1, 2, 2, 2, 1, 2, 6, 6, 2, 20, 924, 252, 70, 6, 252, 6, 2, 2, 1, 252, 252, 924, 1, 252, 20, 70, 6, 252, 20, 252, 184756, 6, 924, 2, 2, 20, 2, 924, 3432, 70, 6, 252, 40116600, 924, 20, 20, 1, 252, 2, 20, 6, 3432, 252, 6, 12870, 252, 924, 20, 2333606220, 252

Offset: 1

Author

Clark Kimberling, Jan 22 2012

Keywords

• nonn

Comments

For a guide to related sequences, see A204892.

Crossrefs

Cf. A205010, A204892.

Programs

Mathematica

(See the program at A205010.)