login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088947 Positions of records in A069862. 2

%I #13 Jul 29 2024 12:36:39

%S 1,2,5,7,10,13,25,27,31,37,151,277,385,451,902,6314,6601,16627,24673,

%T 30371,31451,32338,36058,41173,44083,44215,47322,52580,558304,659879,

%U 744007,909634

%N Positions of 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.

%H Chuck Seggelin, <a href="https://web.archive.org/web/20040109233713/http://www.plastereddragon.com/maths/catcon.htm">Concatenation of Consecutive Integers</a>.

%e f(31) = 110 which exceeds f(27) = 26; f(451) = 100270; f(902) = 999100.

%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, A088343 (for records themselves).

%K nonn,base

%O 1,2

%A _Robert G. Wilson v_, Oct 29 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 24 2010

%E a(29)-a(32) from _Michael S. Branicky_, Jul 29 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 02:14 EDT 2024. Contains 375396 sequences. (Running on oeis4.)