A337656 - cp's OEIS frontend

A337656 a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n(n-1)/2 different nonzero entries (the maximum possible in both cases).

n	a(n)
1	0
2	1
3	3
4	7
5	12
6	20
7	30
8	44
9	65
10	91
11	107
12	122
13	147
14	196
15	230
16	263
17	329
18	375
19	397
20	472
21	545
22	596
23	677
24	716
25	770
26	931
27	1007
28	1059
29	1201
30	1330
31	1415
32	1484
33	1570
34	1688
35	1934
36	1982
37	2229
38	2391
39	2550
40	2646
41	2837
42	3078
43	3138
44	3208
45	3383
46	3560
47	3596
48	3930
49	4257
50	4421
51	4673

[0, 1, 3, 7, 12, 20, 30, 44, 65, 91, 107, 122, 147, 196, 230, 263, 329, 375, 397, 472, 545, 596, 677, 716, 770, 931, 1007, 1059, 1201, 1330, 1415, 1484, 1570, 1688, 1934, 1982, 2229, 2391, 2550, 2646, 2837, 3078, 3138, 3208, 3383, 3560, 3596, 3930, 4257, 4421, 4673]

cp's OEIS Frontend

A337656 a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n(n-1)/2 different nonzero entries (the maximum possible in both cases).

Table of values

List of values

cp's OEIS Frontend

A337656 a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n*(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n*(n-1)/2 different nonzero entries (the maximum possible in both cases).

Table of values

List of values

A337656 a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n(n-1)/2 different nonzero entries (the maximum possible in both cases).