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.

A003566 Least number m such that 10^m == +- 1 mod (10n + 1).

Table of values

n a(n)
1 1
2 6
3 15
4 5
5 16
6 30
7 35
8 9
9 3
10 2
11 3
12 11
13 65
14 46
15 75
16 33
17 18
18 90
19 95
20 33
21 15
22 48
23 6
24 15
25 25
26 28
27 5
28 14
29 96
30 42
31 155
32 53
33 55
34 30
35 6
36 171
37 78
38 42
39 176
40 100
41 8
42 70
43 215
44 42
45 10
46 230
47 78
48 6
49 245
50 166
51 24
52 26
53 58
54 270
55 252
56 16
57 285
58 246
59 98
60 150
61 69
62 66
63 315
64 16
65 30

List of values

[1, 6, 15, 5, 16, 30, 35, 9, 3, 2, 3, 11, 65, 46, 75, 33, 18, 90, 95, 33, 15, 48, 6, 15, 25, 28, 5, 14, 96, 42, 155, 53, 55, 30, 6, 171, 78, 42, 176, 100, 8, 70, 215, 42, 10, 230, 78, 6, 245, 166, 24, 26, 58, 270, 252, 16, 285, 246, 98, 150, 69, 66, 315, 16, 30]