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.

A216415 a(n) = smallest positive m such that 2n-1 | 10^m-1, or 0 if no such m exists.

Table of values

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

List of values

[1, 1, 0, 6, 1, 2, 6, 0, 16, 18, 6, 22, 0, 3, 28, 15, 2, 0, 3, 6, 5, 21, 0, 46, 42, 16, 13, 0, 18, 58, 60, 6, 0, 33, 22, 35, 8, 0, 6, 13, 9, 41, 0, 28, 44, 6, 15, 0, 96, 2, 4, 34, 0, 53, 108, 3, 112, 0, 6, 48, 22, 5, 0, 42, 21, 130, 18, 0, 8, 46, 46, 6, 0, 42, 148, 75, 16, 0, 78, 13, 66, 81, 0, 166, 78, 18, 43, 0, 58, 178, 180, 60, 0, 16, 6, 95, 192, 0, 98, 99]