|
Search: id:A088886
|
|
|
| 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. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Concatenation always end at n-1 and cannot start further than n-n (zero). Hence the maximum value of a(n) is n.
|
|
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: A087893 A079169 A097106 this_sequence A137347 A024941 A100699
Adjacent sequences: A088883 A088884 A088885 this_sequence A088887 A088888 A088889
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Oct 29 2003
|
|
|
Search completed in 0.002 seconds
|
