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.

A308651 a(n+1) = k(a(n), n), where k(m, n) = (m*n) mod (m+n) and with a(1) = 5.

Table of values

n a(n)
1 5
2 5
3 3
4 3
5 5
6 5
7 8
8 11
9 12
10 3
11 4
12 14
13 12
14 6
15 4
16 3
17 10
18 8
19 14
20 2
21 18
22 27
23 6
24 22
25 22
26 33
27 32
28 38
29 8
30 10
31 20
32 8
33 16
34 38
35 68
36 11
37 20
38 56
39 60
40 63
41 48
42 10
43 4
44 31
45 14
46 40
47 34
48 59
49 50
50 74
51 104
52 34
53 48
54 19
55 4
56 43
57 32
58 44
59 2
60 57
61 27
62 63
63 31
64 73
65 14
66 41
67 31
68 19
69 74
70 101
71 59
72 29
73 68
74 29
75 86
76 10
77 72
78 31
79 20
80 95
81 75
82 147
83 146
84 210
85 0
86 0
87 0
88 0
89 0
90 0
91 0
92 0
93 0
94 0
95 0
96 0
97 0
98 0
99 0
100 0
101 0
102 0
103 0
104 0
105 0
106 0

List of values

[5, 5, 3, 3, 5, 5, 8, 11, 12, 3, 4, 14, 12, 6, 4, 3, 10, 8, 14, 2, 18, 27, 6, 22, 22, 33, 32, 38, 8, 10, 20, 8, 16, 38, 68, 11, 20, 56, 60, 63, 48, 10, 4, 31, 14, 40, 34, 59, 50, 74, 104, 34, 48, 19, 4, 43, 32, 44, 2, 57, 27, 63, 31, 73, 14, 41, 31, 19, 74, 101, 59, 29, 68, 29, 86, 10, 72, 31, 20, 95, 75, 147, 146, 210, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]