OFFSET

1,2

COMMENTS

It is conjectured that after n=4 the sequence is prime for n prime or the previous prime for n not prime.

EXAMPLE

a(6)=5 as 5!=120 which is divisible by 1,2,3,4,5 and 6.

MAPLE

A094802 := proc(n)

local k, nlcm ;

nlcm := A003418(n) ;

for k from 1 do

if modp(k!, nlcm) = 0 then

return k ;

end if;

end do:

end proc:

seq(A094802(n), n=1..30) ; # R. J. Mathar, Nov 15 2019

MATHEMATICA

a[n_] := Module[{k = 1}, While[True, If[AllTrue[Range[n], Divisible[k!, #]&], Return[k]]; k++]];

Table[a[n], {n, 1, 60}] (* Jean-François Alcover, Apr 01 2024 *)

PROG

(PARI) { for (i=1, 60, x=1; for (j=1, i, xf=x!; if (xf%j!=0, x+=1; j=1)); print1(", "x)) }

CROSSREFS

KEYWORD

nonn

AUTHOR

Jon Perry, Jun 11 2004

EXTENSIONS

Corrected by T. D. Noe, Nov 02 2006

STATUS

approved