OFFSET
1,1
COMMENTS
LINKS
Daniel Starodubtsev, Table of n, a(n) for n = 1..300
MATHEMATICA
aQ[n_] := Total[(d = IntegerDigits[n!])[[1;; -1;; 2]]] == Total[d[[2;; -1;; 2]]]; Select[Range[500], aQ] (* Amiram Eldar, Aug 04 2019 *)
PROG
(PARI) isok(k) = {my(d = digits(k!), so=0, se=0); for (i=1, #d, if (i%2, so += d[i], se += d[i])); so == se; } \\ Michel Marcus, Aug 04 2019
(Python)
def c(n): s = str(n); return sum(map(int, s[::2])) == sum(map(int, s[1::2]))
def afind(limit):
k, factk = 1, 1
while k <= limit:
if c(factk): print(k, end=", ")
k += 1; factk *= k
afind(500) # Michael S. Branicky, Nov 18 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Daniel Starodubtsev, Aug 04 2019
STATUS
approved