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.

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

Table of values

n a(n)
1 1
2 3
3 7
4 12
5 22
6 30
7 47
8 61
9 85
10 113
11 126
12 177
13 193
14 246
15 279
16 321
17 341
18 428
19 499
20 571
21 616
22 686
23 754
24 854
25 975
26 1052
27 1150
28 1317
29 1376
30 1457
31 1513
32 1664
33 1761
34 1961
35 2307
36 2434
37 2591
38 2795
39 2843
40 3057
41 3226
42 3405
43 3508
44 3776
45 3930
46 4023
47 4196
48 4575
49 4731

List of values

[1, 3, 7, 12, 22, 30, 47, 61, 85, 113, 126, 177, 193, 246, 279, 321, 341, 428, 499, 571, 616, 686, 754, 854, 975, 1052, 1150, 1317, 1376, 1457, 1513, 1664, 1761, 1961, 2307, 2434, 2591, 2795, 2843, 3057, 3226, 3405, 3508, 3776, 3930, 4023, 4196, 4575, 4731]