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.

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

Table of values

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

List of values

[1, 0, 0, 3, 0, 1, 3, 0, 8, 9, 0, 11, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 23, 21, 0, 0, 0, 0, 29, 30, 0, 0, 0, 0, 0, 4, 0, 3, 0, 0, 0, 0, 0, 22, 3, 0, 0, 48, 0, 2, 17, 0, 0, 54, 0, 56, 0, 0, 0, 11, 0, 0, 21, 0, 65, 9, 0, 4, 23, 0, 3, 0, 0, 74, 0, 0, 0, 39, 0, 33, 0]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.