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.

A125715 a(1)=1. a(n) = the smallest positive integer not occurring earlier in the sequence such that (sum{k=1 to n-1} a(k)) is congruent to a(n) (mod n).

Table of values

n a(n)
1 1
2 3
3 4
4 8
5 6
6 10
7 11
8 19
9 17
10 9
11 22
12 2
13 21
14 7
15 5
16 33
17 25
18 23
19 36
20 42
21 31
22 27
23 40
24 18
25 20
26 24
27 32
28 48
29 51
30 55
31 30
32 72
33 26
34 64
35 37
36 15
37 43
38 63
39 103
40 143
41 16
42 44
43 59
44 45
45 60
46 90
47 56
48 80
49 79
50 75
51 14
52 96
53 52
54 68
55 100
56 108
57 65
58 91
59 84
60 128
61 94
62 146
63 61
64 13
65 110
66 176
67 107
68 99
69 12
70 114

List of values

[1, 3, 4, 8, 6, 10, 11, 19, 17, 9, 22, 2, 21, 7, 5, 33, 25, 23, 36, 42, 31, 27, 40, 18, 20, 24, 32, 48, 51, 55, 30, 72, 26, 64, 37, 15, 43, 63, 103, 143, 16, 44, 59, 45, 60, 90, 56, 80, 79, 75, 14, 96, 52, 68, 100, 108, 65, 91, 84, 128, 94, 146, 61, 13, 110, 176, 107, 99, 12, 114]