|
%I #21 Jul 19 2020 07:23:29
%S 1,2,0,0,3,4,0,0,5,0,0,12,0,7,19,0,4,0,24,0,32,19,0,0,0,5,20,0,0,0,0,
%T 0,0,20,12,0,7,0,0,57,7,0,0,19,0,0,0,0,6,8,83,0,0,15,33,24,0,0,0,0,12,
%U 32,0,38,19,9,0,0,0,23,0,0,0,0,70,71,5,0,57,20,0,17,0,0,0,0,26,0,0,0,0,0,0,0,0,28
%N Smallest m such that 1!+...+m! is divisible by 2n+1, or 0 if no such m exists.
%C From _Robert Israel_, Nov 14 2016: (Start)
%C a(n) < 2*n for n > 1.
%C If a(n) = 0, then a((2*k+1)*n + k) = 0 for all k >= 0.
%C (End)
%D M. R. Mudge, Smarandache Notions Journal, University of Craiova, Vol. VII, No. 1, 1996.
%H Robert Israel, <a href="/A013585/b013585.txt">Table of n, a(n) for n = 0..10000</a>
%p f:= proc(n) local t,r,m;
%p r:= 1; t:= 0;
%p for m from 1 do
%p r:= r*m mod (2*n+1);
%p if r = 0 then return 0 fi;
%p t:= t + r mod (2*n+1);
%p if t = 0 then return m fi;
%p od;
%p end proc:
%p f(0):= 1:
%p map(f, [$0..100]); # _Robert Israel_, Nov 14 2016
%t a[n_] := Module[{t, r, m}, r = 1; t = 0; For[m = 1, True, m++, r = Mod[r m, 2 n + 1]; If[r == 0, Return[0]]; t = Mod[t + r, 2 n + 1]; If[t == 0, Return[m]]]];
%t a[0] = 1;
%t a /@ Range[0, 100] (* _Jean-François Alcover_, Jul 19 2020, after Maple *)
%Y Cf. A003422, A013584.
%K nonn
%O 0,2
%A Michael R. Mudge (Amsorg(AT)aol.com), additional terms from _Allan C. Wechsler_
|
