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

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, 720, 5040, 24, 120, 2, 24, 24, 6, 5040, 720, 720, 6, 24, 120, 120, 6, 40320, 24, 720, 24, 24, 24, 5040, 120, 6, 24, 2, 720, 720, 5040, 6, 24, 2, 120, 40320, 2, 5040

Offset: 1

Author

Clark Kimberling, Jan 21 2012

Keywords

• nonn

Comments

For a guide to related sequences, see A204892.

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A204932, A204892, A204933.

Programs

Maple

f:= proc(n) local t,k,V;
  t:= 1:
  for k from 1 do
    t:= t*k mod n;
    if assigned(V[t]) then return V[t]! else V[t]:= k fi
  od
end proc:
map(f, [$1..100]); # Robert Israel, Nov 10 2024

Mathematica

(See the program at A204932.)