Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Jul 29 2024 12:36:34
%S 1,2,5,9,10,22,25,26,110,998,1158,1410,9860,100270,999100,1005274,
%T 1007044,1055274,1059163,1063242,1065027,1083148,1099446,1103722,
%U 1144506,10146315,99992456,99997120,101009312,101924112,102163463,102706016
%N Records in A069862.
%C A069862 is the smallest k such that n divides the concatenation of numbers from (n+1) to (n+k), where (n+1) is on the most significant side. - _Robert G. Wilson v_, Nov 14 2003
%H Chuck Seggelin, <a href="https://web.archive.org/web/20040109233713/http://www.plastereddragon.com/maths/catcon.htm">Concatenation of Consecutive Integers</a>.
%t f[n_] := Block[{k = n + 1}, d = k; While[ d != 0, k++; d = Mod[d*10^Floor[ Log[10, k] + 1] + k, n]]; k - n]; a = 0; Do[b = f[n]; If[b > a, a = b; Print[n, " = ", b]], {n, 1, 34500}]
%Y Cf. A069862, A088947.
%K nonn,more,base
%O 1,2
%A _N. J. A. Sloane_, Nov 14 2003
%E More terms from _Robert G. Wilson v_ and Chuck Seggelin (chuck(AT)plastereddragon.com), Nov 14 2003
%E Edited by _Charles R Greathouse IV_, Apr 30 2010
%E a(29)-a(32) from _Michael S. Branicky_, Jul 29 2024