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.

A079852 a(1) = 1, a(2) = 2, a(3) = 3 and a(n) is the smallest number such that all a(i)*a(j)*a(k) are different.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 7
7 9
8 11
9 13
10 16
11 17
12 19
13 23
14 25
15 29
16 31
17 37
18 41
19 43
20 47
21 49
22 53
23 59
24 61
25 67
26 71
27 73
28 79
29 81
30 83
31 89
32 97
33 101
34 103
35 107
36 109
37 113
38 121
39 127
40 128
41 131
42 137
43 139
44 149
45 151
46 157
47 163
48 167
49 169
50 173
51 179
52 181
53 191
54 193
55 197
56 199
57 210
58 211
59 223
60 227
61 229
62 233
63 239
64 241
65 251
66 257
67 263
68 269
69 271
70 277
71 281
72 283
73 289
74 293
75 307
76 311
77 313
78 317
79 331

List of values

[1, 2, 3, 4, 5, 7, 9, 11, 13, 16, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 210, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 289, 293, 307, 311, 313, 317, 331]