cp's OEIS Frontend

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

%I A204935 #13 Nov 11 2024 01:59:24
%S A204935 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 A204935 720,5040,24,120,2,24,24,6,5040,720,720,6,24,120,120,6,40320,24,720,
%U A204935 24,24,24,5040,120,6,24,2,720,720,5040,6,24,2,120,40320,2,5040
%N A204935 The number j! such that n divides k!-j!>0, where k is the least positive integer for which such a j exists.
%C A204935 For a guide to related sequences, see A204892.
%H A204935 Robert Israel, <a href="/A204935/b204935.txt">Table of n, a(n) for n = 1..10000</a>
%p A204935 f:= proc(n) local t,k,V;
%p A204935   t:= 1:
%p A204935   for k from 1 do
%p A204935     t:= t*k mod n;
%p A204935     if assigned(V[t]) then return V[t]! else V[t]:= k fi
%p A204935   od
%p A204935 end proc:
%p A204935 map(f, [$1..100]); # _Robert Israel_, Nov 10 2024
%t A204935 (See the program at A204932.)
%Y A204935 Cf. A204932, A204892, A204933.
%K A204935 nonn
%O A204935 1,2
%A A204935 _Clark Kimberling_, Jan 21 2012