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.

A099520 a(1)=1; for n>1, a(n)=smallest integer m>0 not yet appearing in sequence such that m+a(n-1) is a multiple of n-1.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 3
6 7
7 11
8 10
9 6
10 12
11 8
12 14
13 22
14 17
15 25
16 20
17 28
18 23
19 13
20 44
21 16
22 26
23 18
24 51
25 21
26 29
27 49
28 32
29 24
30 34
31 56
32 37
33 27
34 39
35 63
36 42
37 30
38 81
39 33
40 45
41 35
42 47
43 79
44 50
45 38
46 52
47 40
48 54
49 90
50 57
51 43
52 59
53 97
54 9
55 99
56 66
57 46
58 68
59 48
60 70
61 110
62 73
63 113
64 76
65 116
66 144
67 120
68 148
69 124
70 83

List of values

[1, 2, 4, 5, 3, 7, 11, 10, 6, 12, 8, 14, 22, 17, 25, 20, 28, 23, 13, 44, 16, 26, 18, 51, 21, 29, 49, 32, 24, 34, 56, 37, 27, 39, 63, 42, 30, 81, 33, 45, 35, 47, 79, 50, 38, 52, 40, 54, 90, 57, 43, 59, 97, 9, 99, 66, 46, 68, 48, 70, 110, 73, 113, 76, 116, 144, 120, 148, 124, 83]