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.

A347498 Least k such that there exists an n-element subset S of {1,2,...,k} with the property that all products i * j are distinct for i <= j.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 7
7 9
8 11
9 13
10 15
11 17
12 19
13 20
14 23
15 25
16 28
17 29
18 31
19 33
20 37
21 40
22 41
23 42
24 43
25 47
26 51
27 53
28 55
29 57
30 59
31 61
32 67
33 69
34 71
35 73
36 75
37 79
38 83

List of values

[1, 2, 3, 5, 6, 7, 9, 11, 13, 15, 17, 19, 20, 23, 25, 28, 29, 31, 33, 37, 40, 41, 42, 43, 47, 51, 53, 55, 57, 59, 61, 67, 69, 71, 73, 75, 79, 83]