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.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 0
6 0
7 2
8 0
9 8
10 0
11 3
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 14
22 0
23 0
24 0
25 0
26 0
27 26
28 0
29 6
30 0
31 0
32 0
33 11
34 0
35 0
36 0
37 10
38 0
39 0
40 0
41 16
42 0
43 15
44 0
45 0
46 0
47 25
48 0
49 4
50 0
51 45
52 0
53 0
54 0
55 0
56 0
57 20
58 0
59 51
60 0
61 45
62 0
63 0
64 0
65 0
66 0
67 2
68 0
69 35
70 0
71 22
72 0
73 0
74 0
75 0
76 0
77 21
78 0
79 0
80 0
81 0
82 0
83 81
84 0
85 0
86 0
87 6
88 0
89 0
90 0
91 0
92 0
93 66
94 0
95 0
96 0
97 13

List of values

[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]