A048846 Least positive integer k for which 29^n divides k!.

1, 29, 58, 87, 116, 145, 174, 203, 232, 261, 290, 319, 348, 377, 406, 435, 464, 493, 522, 551, 580, 609, 638, 667, 696, 725, 754, 783, 812, 841, 841, 870, 899, 928, 957, 986, 1015, 1044, 1073, 1102, 1131, 1160, 1189, 1218, 1247, 1276

Offset

0,2

Links

T. D. Noe, Table of n, a(n) for n = 0..1000

Mathematica

f[n_]:=Module[{k=1}, While[!Divisible[k!, 29^n], k++]; k]; Array[f, 50, 0] (* Harvey P. Dale, Sep 04 2011 *)

Prog

(Python)
from itertools import count
from sympy import multiplicity
def A048846(n):
    if n == 0: return 1
    c = 0
    for k in count(29, 29):
        c += multiplicity(29, k)
        if c+k+29 > n:
            return 29*(max(k, n-c) if n>=29 else n+1-c) # Chai Wah Wu, Feb 24 2026

Crossrefs

See A007843 for more information.

Sequence in context: A333912 A333913 A164011 * A195819 A248786 A004922

Adjacent sequences: A048843 A048844 A048845 * A048847 A048848 A048849

Keyword

nonn

Author

Charles T. Le (charlestle(AT)yahoo.com)

Status

approved