A214747 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A214747

Least m>0 such that n-m divides n!!+m.

2

1, 1, 1, 1, 3, 3, 1, 3, 3, 9, 6, 9, 7, 3, 8, 15, 9, 17, 10, 7, 11, 7, 12, 15, 13, 9, 14, 25, 15, 15, 16, 11, 17, 21, 13, 33, 19, 13, 11, 39, 21, 41, 22, 9, 23, 15, 1, 35, 3, 17, 26, 49, 11, 11, 28, 19, 29, 57, 1, 57, 3, 7, 32, 39, 33, 65, 34, 23, 11, 55, 36, 71, 37, 25

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,5

LINKS

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

EXAMPLE

Write x#y if x|y is false; then 5#49, 4#50, 3|51, so a(6) = 3.

MATHEMATICA

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

CROSSREFS

Sequence in context: A092040 A293866 A161200 * A110766 A166314 A109630

Adjacent sequences: A214744 A214745 A214746 * A214748 A214749 A214750

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 29 2012

STATUS

approved