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.

A095250 a(n) = 11111111... (n times) = (10^n-1)/9 reduced mod n.

Table of values

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

List of values

[0, 1, 0, 3, 1, 3, 1, 7, 0, 1, 1, 3, 1, 11, 6, 7, 1, 9, 1, 11, 6, 11, 1, 15, 11, 11, 0, 19, 1, 21, 1, 7, 12, 11, 16, 27, 1, 11, 33, 31, 1, 21, 1, 11, 36, 11, 1, 39, 36, 11, 9, 19, 1, 27, 1, 39, 54, 11, 1, 51, 1, 11, 27, 7, 61, 33, 1, 23, 42, 61, 1, 63, 1, 11, 36, 47, 23, 39, 1, 71, 0, 11, 1, 63]