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.

A099506 a(1)=1; for n > 1, a(n)=smallest m>0 that has not appeared so far in the sequence such that m+a(n-1) is a multiple of n.

Table of values

n a(n)
1 1
2 3
3 6
4 2
5 8
6 4
7 10
8 14
9 13
10 7
11 15
12 9
13 17
14 11
15 19
16 29
17 5
18 31
19 26
20 34
21 50
22 16
23 30
24 18
25 32
26 20
27 61
28 23
29 35
30 25
31 37
32 27
33 39
34 63
35 42
36 66
37 45
38 69
39 48
40 72
41 51
42 33
43 53
44 79
45 56
46 36
47 58
48 38
49 60
50 40
51 62
52 94
53 12
54 96
55 124
56 44
57 70
58 46
59 131
60 49
61 73
62 113
63 76
64 52
65 78
66 54
67 80
68 192
69 84
70 126
71 87

List of values

[1, 3, 6, 2, 8, 4, 10, 14, 13, 7, 15, 9, 17, 11, 19, 29, 5, 31, 26, 34, 50, 16, 30, 18, 32, 20, 61, 23, 35, 25, 37, 27, 39, 63, 42, 66, 45, 69, 48, 72, 51, 33, 53, 79, 56, 36, 58, 38, 60, 40, 62, 94, 12, 96, 124, 44, 70, 46, 131, 49, 73, 113, 76, 52, 78, 54, 80, 192, 84, 126, 87]