cp's OEIS Frontend

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.

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.

Original entry on oeis.org

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
Offset: 1

Views

Author

Chuck Seggelin, Oct 29 2003

Keywords

Comments

Concatenation always end at n-1 and cannot start further than n-n (zero). Hence the maximum value of a(n) is n.

Examples

			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