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.

A337655 a(1)=1; thereafter, a(n) is the smallest number such that both the addition and multiplication tables for (a(1),...,a(n)) contain n*(n+1)/2 different entries (the maximum possible).

Table of values

n a(n)
1 1
2 2
3 5
4 7
5 15
6 22
7 31
8 50
9 68
10 90
11 101
12 124
13 163
14 188
15 215
16 253
17 322
18 358
19 455
20 486
21 527
22 631
23 702
24 780
25 838
26 920
27 1030
28 1062
29 1197
30 1289
31 1420
32 1500
33 1689
34 1765
35 1886
36 2114
37 2353
38 2410
39 2570
40 2686
41 2857
42 3063
43 3207
44 3477
45 3616
46 3845
47 3951
48 4150
49 4480
50 4595
51 4746
52 5030
53 5286
54 5698
55 5999
56 6497
57 6624
58 6938
59 7219
60 7661
61 7838
62 8469
63 8665
64 9198
65 9351
66 9667
67 9966

List of values

[1, 2, 5, 7, 15, 22, 31, 50, 68, 90, 101, 124, 163, 188, 215, 253, 322, 358, 455, 486, 527, 631, 702, 780, 838, 920, 1030, 1062, 1197, 1289, 1420, 1500, 1689, 1765, 1886, 2114, 2353, 2410, 2570, 2686, 2857, 3063, 3207, 3477, 3616, 3845, 3951, 4150, 4480, 4595, 4746, 5030, 5286, 5698, 5999, 6497, 6624, 6938, 7219, 7661, 7838, 8469, 8665, 9198, 9351, 9667, 9966]