T. D. Noe, <a href="/A048842/b048842.txt">Table of n, a(n) for n = 0..1000</a>
T. D. Noe, <a href="/A048842/b048842.txt">Table of n, a(n) for n = 0..1000</a>
proposed
approved
editing
proposed
(PARI) a(n) = {k = 1; ok = 0; until (ok, if (k! % 13^n == 0, ok=1, k++); ); return (k); } \\ Michel Marcus, Jun 30 2013
approved
editing
T. D. Noe, <a href="/A048842/b048842.txt">Table of n, a(n) for n=0..1000</a>
nonn,new
nonn
T. D. Noe, <a href="http://www.research.att.com/~njas/sequences/b048842.txt">Table of n, a(n) for n=0..1000</a>
nonn,new
nonn
T. D. Noe, <a href="http://www.research.att.com/~njas/sequences/b048842.txt">Table of n, a(n) for n=0..1000</a>
nonn,new
nonn
nonn,new
nonn
Charles T. Le (charlestle@(AT)yahoo.com)
Least positive integer k for which 13^n divides k!.
1, 13, 26, 39, 52, 65, 78, 91, 104, 117, 130, 143, 156, 169, 169, 182, 195, 208, 221, 234, 247, 260, 273, 286, 299, 312, 325, 338, 338, 351, 364, 377, 390, 403, 416, 429, 442, 455, 468, 481, 494, 507, 507, 520, 533, 546, 559, 572, 585, 598
0,2
See A007843 for more information.
nonn
Charles T. Le ([email protected])
approved