OFFSET
0,2
LINKS
T. D. Noe, Table of n, a(n) for n = 0..1000
MATHEMATICA
k[n_]:=Module[{c=11^n, k=11}, While[!Divisible[k!, c], k=k+11]; k]; Join[{1}, Array[k, 60]] (* Harvey P. Dale, May 30 2012 *)
PROG
(Python)
from itertools import count
from sympy import multiplicity
def A048841(n):
if n == 0: return 1
c = 0
for k in count(11, 11):
c += multiplicity(11, k)
if c+k+11 > n:
return 11*(max(k, n-c) if n>=11 else n+1-c) # Chai Wah Wu, Feb 24 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Charles T. Le (charlestle(AT)yahoo.com)
STATUS
approved
