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.

A368382 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 A004280(n)).

Table of values

n a(n)
1 1
2 3
3 6
4 11
5 4
6 13
7 2
8 15
9 30
10 47
11 9
12 51
13 5
14 55
15 28
16 57
17 26
18 59
19 24
20 61
21 22
22 63
23 20
24 65
25 18
26 67
27 16
28 69
29 14
30 71
31 12
32 73
33 10
34 75
35 8
36 77
37 148
38 221
39 146
40 223
41 144
42 225
43 142
44 227
45 53
46 231
47 49
48 235
49 45
50 239
51 41
52 243
53 37
54 247
55 33
56 251
57 29
58 255
59 25
60 259
61 21
62 263
63 17
64 267
65 140
66 269
67 7
68 273
69 138
70 275
71 136
72 277
73 134
74 279
75 132
76 281

List of values

[1, 3, 6, 11, 4, 13, 2, 15, 30, 47, 9, 51, 5, 55, 28, 57, 26, 59, 24, 61, 22, 63, 20, 65, 18, 67, 16, 69, 14, 71, 12, 73, 10, 75, 8, 77, 148, 221, 146, 223, 144, 225, 142, 227, 53, 231, 49, 235, 45, 239, 41, 243, 37, 247, 33, 251, 29, 255, 25, 259, 21, 263, 17, 267, 140, 269, 7, 273, 138, 275, 136, 277, 134, 279, 132, 281]