login

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”).

A088343
Records in A069862.
2
1, 2, 5, 9, 10, 22, 25, 26, 110, 998, 1158, 1410, 9860, 100270, 999100, 1005274, 1007044, 1055274, 1059163, 1063242, 1065027, 1083148, 1099446, 1103722, 1144506, 10146315, 99992456, 99997120, 101009312, 101924112, 102163463, 102706016
OFFSET
1,2
COMMENTS
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
MATHEMATICA
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}]
CROSSREFS
Sequence in context: A224866 A348167 A159073 * A110781 A170838 A115248
KEYWORD
nonn,more,base
AUTHOR
N. J. A. Sloane, Nov 14 2003
EXTENSIONS
More terms from Robert G. Wilson v and Chuck Seggelin (chuck(AT)plastereddragon.com), Nov 14 2003
Edited by Charles R Greathouse IV, Apr 30 2010
a(29)-a(32) from Michael S. Branicky, Jul 29 2024
STATUS
approved