The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088886 Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in ascending order such that n divides the concatenated term, or zero if n divides no such concatenation. 2
 1, 0, 2, 0, 0, 0, 2, 0, 8, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 26, 0, 6, 0, 0, 0, 11, 0, 0, 0, 10, 0, 0, 0, 16, 0, 15, 0, 0, 0, 25, 0, 4, 0, 45, 0, 0, 0, 0, 0, 20, 0, 51, 0, 45, 0, 0, 0, 0, 0, 2, 0, 35, 0, 22, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 81, 0, 0, 0, 6, 0, 0, 0, 0, 0, 66, 0, 0, 0, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Concatenation always end at n-1 and cannot start further than n-n (zero). Hence the maximum value of a(n) is n. LINKS EXAMPLE a(7) = 2 because 7 will divide the number formed by concatenating the 2 integers prior to 7 in ascending order (i.e. 56). a(6) = 0 because 6 will not divide 5, 45, 345, 2345, 12345, or 012345. CROSSREFS Cf. A088797, A088799, A088868, A088870, A088872, A088885. Sequence in context: A326067 A318879 A333783 * A317636 A305566 A326813 Adjacent sequences:  A088883 A088884 A088885 * A088887 A088888 A088889 KEYWORD base,nonn AUTHOR Chuck Seggelin (barkeep(AT)plastereddragon.com), Oct 29 2003 STATUS approved

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

Last modified October 1 08:39 EDT 2020. Contains 337442 sequences. (Running on oeis4.)