A204935 - OEIS

%I #13 Nov 11 2024 01:59:24

%S 1,2,6,2,1,6,1,24,6,120,2,24,24,6,120,24,1,6,6,120,6,2,1,24,120,24,

%T 720,5040,24,120,2,24,24,6,5040,720,720,6,24,120,120,6,40320,24,720,

%U 24,24,24,5040,120,6,24,2,720,720,5040,6,24,2,120,40320,2,5040

%N The number j! such that n divides k!-j!>0, where k is the least positive integer for which such a j exists.

%C For a guide to related sequences, see A204892.

%H Robert Israel, <a href="/A204935/b204935.txt">Table of n, a(n) for n = 1..10000</a>

%p f:= proc(n) local t,k,V;

%p   t:= 1:

%p   for k from 1 do

%p     t:= t*k mod n;

%p     if assigned(V[t]) then return V[t]! else V[t]:= k fi

%p   od

%p end proc:

%p map(f, [$1..100]); # _Robert Israel_, Nov 10 2024

%t (See the program at A204932.)

%Y Cf. A204932, A204892, A204933.

%K nonn

%O 1,2

%A _Clark Kimberling_, Jan 21 2012