A214748 Least m>0 such that n-m divides (2*n-1)!!+m.

1, 1, 3, 3, 3, 5, 7, 3, 5, 9, 9, 11, 7, 5, 15, 15, 9, 17, 15, 7, 11, 21, 21, 15, 13, 9, 21, 27, 15, 29, 31, 11, 17, 21, 27, 35, 19, 13, 35, 39, 21, 41, 33, 15, 23, 45, 45, 35, 25, 17, 39, 51, 27, 33, 49, 19, 29, 57, 45, 59, 31, 21, 63, 39, 33, 65, 51, 23, 35, 69, 63

Offset

2,3

Links

Clark Kimberling, Table of n, a(n) for n = 2..1000

Example

Write x#y if x|y is false; then 4#946, 3#947, 2|948, so a(5) = 3.

Mathematica

Table[m = 1; While[! Divisible[(2n-1)!!+m, n-m], m++]; m, {n, 2, 100}]

Crossrefs

Cf. A214747.

Sequence in context: A117900 A318203 A282243 * A225225 A290562 A346476

Adjacent sequences: A214745 A214746 A214747 * A214749 A214750 A214751

Keyword

nonn,easy

Author

Clark Kimberling, Jul 29 2012

Status

approved