%I #9 Aug 22 2012 15:55:28
%S 5,1,3,4,4,2,3,4,5,5,7,3,7,4,5,5,7,6,5,4,7,8,5,6,5,6,3,7,7,5,9,4,7,6,
%T 5,9,5,7,6,8,7,6,11,4,9,9,7,8,7,10,5,8,7,6,5,7,9,6,11,10,9,8,7,8,5,6,
%U 8,4,11,10,9,8,7,6,9,8,7,12,5,10,9,8,7,6,11,10,9,8,11,6,13,8,11,11,10,9,8
%N Smallest k such that n+k divides (k+1)!+k!.
%H Harvey P. Dale, <a href="/A071545/b071545.txt">Table of n, a(n) for n = 1..1000</a>
%t sk[n_]:=Module[{k=1},While[!Divisible[(k+1)!+k!,n+k],k++];k]; Array[sk,100] (* _Harvey P. Dale_, Aug 22 2012 *)
%K easy,nonn
%O 1,1
%A _Benoit Cloitre_, May 30 2002