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.

A229303 Numbers m such that A031971(2*m) == m (mod 2*m).

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 7
6 8
7 11
8 13
9 14
10 16
11 17
12 19
13 22
14 23
15 25
16 26
17 28
18 29
19 31
20 32
21 34
22 35
23 37
24 38
25 41
26 43
27 44
28 46
29 47
30 49
31 52
32 53
33 56
34 58
35 59
36 61
37 62
38 64
39 65
40 67
41 68
42 71
43 73
44 74
45 76
46 77
47 79
48 82
49 83
50 85
51 86
52 88
53 89
54 91
55 92
56 94
57 95
58 97
59 98
60 101
61 103
62 104
63 106
64 107
65 109
66 112
67 113
68 115
69 116
70 118
71 119
72 121
73 122
74 124
75 125

List of values

[1, 2, 4, 5, 7, 8, 11, 13, 14, 16, 17, 19, 22, 23, 25, 26, 28, 29, 31, 32, 34, 35, 37, 38, 41, 43, 44, 46, 47, 49, 52, 53, 56, 58, 59, 61, 62, 64, 65, 67, 68, 71, 73, 74, 76, 77, 79, 82, 83, 85, 86, 88, 89, 91, 92, 94, 95, 97, 98, 101, 103, 104, 106, 107, 109, 112, 113, 115, 116, 118, 119, 121, 122, 124, 125]