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.

A364054 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 prime(n-1)).

Table of values

n a(n)
1 1
2 3
3 6
4 11
5 4
6 15
7 2
8 19
9 38
10 61
11 32
12 63
13 26
14 67
15 24
16 71
17 18
18 77
19 16
20 83
21 12
22 85
23 164
24 81
25 170
26 73
27 174
28 277
29 384
30 57
31 283
32 29
33 160
34 23
35 162
36 13
37 315
38 158
39 321
40 154
41 327
42 148
43 329
44 138
45 331
46 134
47 333
48 122
49 345
50 118
51 347
52 114
53 353
54 112
55 363
56 106
57 369
58 100
59 371
60 94
61 375
62 92
63 385

List of values

[1, 3, 6, 11, 4, 15, 2, 19, 38, 61, 32, 63, 26, 67, 24, 71, 18, 77, 16, 83, 12, 85, 164, 81, 170, 73, 174, 277, 384, 57, 283, 29, 160, 23, 162, 13, 315, 158, 321, 154, 327, 148, 329, 138, 331, 134, 333, 122, 345, 118, 347, 114, 353, 112, 363, 106, 369, 100, 371, 94, 375, 92, 385]