login
A048841
Least positive integer k for which 11^n divides k!.
2
1, 11, 22, 33, 44, 55, 66, 77, 88, 99, 110, 121, 121, 132, 143, 154, 165, 176, 187, 198, 209, 220, 231, 242, 242, 253, 264, 275, 286, 297, 308, 319, 330, 341, 352, 363, 363, 374, 385, 396, 407, 418, 429, 440, 451, 462, 473, 484, 484, 495, 506
OFFSET
0,2
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
See A007843 for more information.
Sequence in context: A109052 A178358 A044896 * A059632 A008593 A135499
KEYWORD
nonn
AUTHOR
Charles T. Le (charlestle(AT)yahoo.com)
STATUS
approved