OFFSET
1,1
COMMENTS
Since (k-1) | !k, we have lpf(!k) <= lpf(k-1). This sequence gives the values of k for which the inequality holds.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
okQ[k_, p_] := Module[{q = 2}, While[q < p && !Divisible[k, q], q = NextPrime[q]]; q < p]; q[k_] := okQ[Subfactorial[k], FactorInteger[k-1][[1, 1]]]; Select[Range[3, 650], q]
PROG
(PARI) ok(k, p) = {my(q = 2); while(q < p && k % q, q = nextprime(q+1)); q < p; }
lista(kmax) = {my(s = 1); for(k = 3, kmax, s = k * s + (-1)^k; if(ok(s, factor(k-1)[1, 1]), print1(k, ", "))); }
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Nov 18 2024
STATUS
approved