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.

A067935 Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n)==rep(2) (mod n).

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 10
6 14
7 20
8 22
9 25
10 26
11 34
12 38
13 44
14 46
15 50
16 58
17 62
18 74
19 82
20 86
21 94
22 100
23 106
24 110
25 118
26 122
27 134
28 140
29 142
30 146
31 158
32 166
33 178
34 182
35 185
36 194
37 202
38 206
39 214
40 218
41 220
42 226
43 254
44 260
45 262
46 274
47 278
48 298
49 302
50 308
51 314
52 326
53 334
54 346
55 350
56 358
57 362

List of values

[1, 2, 4, 5, 10, 14, 20, 22, 25, 26, 34, 38, 44, 46, 50, 58, 62, 74, 82, 86, 94, 100, 106, 110, 118, 122, 134, 140, 142, 146, 158, 166, 178, 182, 185, 194, 202, 206, 214, 218, 220, 226, 254, 260, 262, 274, 278, 298, 302, 308, 314, 326, 334, 346, 350, 358, 362]

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

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