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.

A125717 a(0)=0; thereafter a(n) = the smallest nonnegative integer not already in the sequence such that a(n-1) is congruent to a(n) (mod n).

Table of values

n a(n)
0 0
1 1
2 3
3 6
4 2
5 7
6 13
7 20
8 4
9 22
10 12
11 23
12 11
13 24
14 10
15 25
16 9
17 26
18 8
19 27
20 47
21 5
22 49
23 72
24 48
25 73
26 21
27 75
28 19
29 77
30 17
31 79
32 15
33 81
34 115
35 45
36 117
37 43
38 119
39 41
40 121
41 39
42 123
43 37
44 125
45 35
46 127
47 33
48 129
49 31
50 131
51 29
52 133
53 80
54 134
55 189
56 245
57 74
58 16
59 193
60 253
61 70
62 132
63 69
64 197
65 67
66 199
67 65

List of values

[0, 1, 3, 6, 2, 7, 13, 20, 4, 22, 12, 23, 11, 24, 10, 25, 9, 26, 8, 27, 47, 5, 49, 72, 48, 73, 21, 75, 19, 77, 17, 79, 15, 81, 115, 45, 117, 43, 119, 41, 121, 39, 123, 37, 125, 35, 127, 33, 129, 31, 131, 29, 133, 80, 134, 189, 245, 74, 16, 193, 253, 70, 132, 69, 197, 67, 199, 65]