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.

A370952 a(1) = 1; for n > 1, a(n) is the least positive integer not already in the sequence such that a(n) == a(n-1) (mod 2*n-1).

Table of values

n a(n)
1 1
2 4
3 9
4 2
5 11
6 22
7 35
8 5
9 39
10 20
11 41
12 18
13 43
14 16
15 45
16 14
17 47
18 12
19 49
20 10
21 51
22 8
23 53
24 6
25 55
26 106
27 159
28 104
29 161
30 102
31 163
32 37
33 167
34 33
35 171
36 29
37 175
38 25
39 179
40 21
41 183
42 17
43 187
44 13
45 191
46 100
47 7
48 197
49 3
50 201
51 302
52 96
53 306
54 92
55 310
56 88
57 314
58 84
59 318
60 80
61 322
62 76
63 326
64 72
65 330
66 68
67 334
68 64
69 338
70 60
71 342
72 56
73 346
74 52
75 350

List of values

[1, 4, 9, 2, 11, 22, 35, 5, 39, 20, 41, 18, 43, 16, 45, 14, 47, 12, 49, 10, 51, 8, 53, 6, 55, 106, 159, 104, 161, 102, 163, 37, 167, 33, 171, 29, 175, 25, 179, 21, 183, 17, 187, 13, 191, 100, 7, 197, 3, 201, 302, 96, 306, 92, 310, 88, 314, 84, 318, 80, 322, 76, 326, 72, 330, 68, 334, 64, 338, 60, 342, 56, 346, 52, 350]