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 A099119 #10 Feb 16 2025 08:32:54
%S A099119 0,18,48,12,20,0,112,1800,45,90,2475,48,5005,140,30,24,69632,90,
%T A099119 235144,60,750,4950
%N A099119 Conjectured greatest k such that S(k) = S(k-n), or 0 if no k is known, where S is the Kempner function A002034.
%C A099119 Numbers k up to 10^8 have been tested. Tutescu's conjecture is the case n=1.
%D A099119 L. Tutescu, "On a Conjecture Concerning the Smarandache Function." Abstracts of Papers Presented to the Amer. Math. Soc. 17, 583, 1996.
%H A099119 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SmarandacheFunction.html">Smarandache Function</a>
%t A099119 (*See A002034 for the Kempner function*) nMax=22; iMax=10^6; iTab=Table[{}, {nMax}]; cTab=Table[0, {nMax}]; a=Table[Kempner[i], {i, nMax+1}]; Do[If[a[[i]]==a[[i-n]], cTab[[n]]++; AppendTo[iTab[[n]], i]], {n, nMax}, {i, n+1, nMax+1}]; Do[a=RotateLeft[a]; a[[nMax+1]]=Kempner[i]; Do[If[a[[nMax+1]]==a[[nMax-n+1]], cTab[[n]]++; AppendTo[iTab[[n]], i]], {n, nMax}], {i, nMax+2, iMax}]; Table[If[iTab[[n]]=={}, 0, Last[iTab[[n]]]], {n, nMax}]
%Y A099119 Cf. A099118 (number of times S(k+n) = S(k)), A099120 (least m such that n = S(k) = S(k+m)).
%K A099119 nonn
%O A099119 1,2
%A A099119 _T. D. Noe_, Sep 28 2004