This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A029716 #18 Jul 08 2025 19:18:01
%S A029716 1,3,6,10,15,18,25,29,35,40,51,55,68,75,80,86,103,109,128,133,140,151,
%T A029716 174,178,188,201,210,217,246,251,282,290,301,318,325,331,368,387,400,
%U A029716 405,446,453,496,507,513,536,583,589,603,613,630,643,696,705,716,723,742
%N A029716 Partial sums of Kempner numbers A002034.
%C A029716 Comment from _Jonathan Vos Post_, May 18 2010 (Start):
%C A029716 The subsequence of primes begins: 3, 29, 103, 109, 151, 251, 331, 613, 643, 1033, 1151, 1277, 1307, 1399.
%C A029716 The subsequence of perfect powers begins: 1, 25, 128, 400, 1296. (End)
%H A029716 Vaclav Kotesovec, <a href="/A029716/b029716.txt">Table of n, a(n) for n = 1..10000</a>
%H A029716 Li Hailong and Zhao Xiaopeng, <a href="https://citeseerx.ist.psu.edu/pdf/134f67dafd17bab61928c5a02e2e9808a27a1dad">On the Smarandache function and the k-th roots of a positive integer</a>, 2004, p. 119.
%F A029716 a(n) ~ Pi^2 * n^2 / (12 * log(n)) [Li Hailong and Zhao Xiaopeng, 2004]. - _Vaclav Kotesovec_, Jul 29 2021
%t A029716 Accumulate[Table[found = 0; m = 1; While[found == 0, If[IntegerQ[m!/n], found = 1, m++]]; m, {n, 1, 100}]] (* _Vaclav Kotesovec_, Jul 29 2021 *)
%Y A029716 Cf. A000142, A002034, A007672 - A002034(n)!/n, A064759, A094371, A094372, A046022, A094404. Cf. also A006530, A057109, A001113, A122378, A122379, A122416, A122417. [_Jonathan Vos Post_, May 18 2010]
%K A029716 nonn
%O A029716 1,2
%A A029716 _N. J. A. Sloane_
%E A029716 More terms from _Vaclav Kotesovec_, Jul 29 2021