A026098 - cp's OEIS frontend

A026098 Triangular array T read by rows: T(1,1)=1, T(2,1)=3, T(2,2)=2; for n >= 3, T(n,1)=prime(n) and for k=2,3,...,n, T(n,k) = mprime(n+1-k), where m is the least positive integer such that mp(n+1-k) is not any T(i,j) for 1<=i<=n-1 nor any T(n,j) for j<=k-1.

n	a(n)
1	1
2	3
3	2
4	5
5	6
6	4
7	7
8	10
9	9
10	8
11	11
12	14
13	15
14	12
15	16
16	13
17	22
18	21
19	20
20	18
21	24
22	17
23	26
24	33
25	28
26	25
27	27
28	30
29	19
30	34
31	39
32	44
33	35
34	40
35	36
36	32
37	23
38	38
39	51
40	52
41	55
42	42
43	45
44	48
45	46
46	29
47	69
48	57
49	68
50	65
51	66
52	49
53	50
54	54
55	56
56	31
57	58
58	92
59	76
60	85
61	78
62	77
63	63
64	60
65	72
66	62
67	37
68	93
69	87
70	115
71	95
72	102
73	91
74	88
75	70
76	75
77	81
78	64

[1, 3, 2, 5, 6, 4, 7, 10, 9, 8, 11, 14, 15, 12, 16, 13, 22, 21, 20, 18, 24, 17, 26, 33, 28, 25, 27, 30, 19, 34, 39, 44, 35, 40, 36, 32, 23, 38, 51, 52, 55, 42, 45, 48, 46, 29, 69, 57, 68, 65, 66, 49, 50, 54, 56, 31, 58, 92, 76, 85, 78, 77, 63, 60, 72, 62, 37, 93, 87, 115, 95, 102, 91, 88, 70, 75, 81, 64]

cp's OEIS Frontend

A026098 Triangular array T read by rows: T(1,1)=1, T(2,1)=3, T(2,2)=2; for n >= 3, T(n,1)=prime(n) and for k=2,3,...,n, T(n,k) = mprime(n+1-k), where m is the least positive integer such that mp(n+1-k) is not any T(i,j) for 1<=i<=n-1 nor any T(n,j) for j<=k-1.

Table of values

List of values

n	a(n)
1	1
2	3
3	2
4	5
5	6
6	4
7	7
8	10
9	9
10	8
11	11
12	14
13	15
14	12
15	16
16	13
17	22
18	21
19	20
20	18
21	24
22	17
23	26
24	33
25	28
26	25
27	27
28	30
29	19
30	34
31	39
32	44
33	35
34	40
35	36
36	32
37	23
38	38
39	51
40	52
41	55
42	42
43	45
44	48
45	46
46	29
47	69
48	57
49	68
50	65
51	66
52	49
53	50
54	54
55	56
56	31
57	58
58	92
59	76
60	85
61	78
62	77
63	63
64	60
65	72
66	62
67	37
68	93
69	87
70	115
71	95
72	102
73	91
74	88
75	70
76	75
77	81
78	64

n	a(n)
1	1
2	3
3	2
4	5
5	6
6	4
7	7
8	10
9	9
10	8
11	11
12	14
13	15
14	12
15	16
16	13
17	22
18	21
19	20
20	18
21	24
22	17
23	26
24	33
25	28
26	25
27	27
28	30
29	19
30	34
31	39
32	44
33	35
34	40
35	36
36	32
37	23
38	38
39	51
40	52
41	55
42	42
43	45
44	48
45	46
46	29
47	69
48	57
49	68
50	65
51	66
52	49
53	50
54	54
55	56
56	31
57	58
58	92
59	76
60	85
61	78
62	77
63	63
64	60
65	72
66	62
67	37
68	93
69	87
70	115
71	95
72	102
73	91
74	88
75	70
76	75
77	81
78	64

cp's OEIS Frontend

A026098 Triangular array T read by rows: T(1,1)=1, T(2,1)=3, T(2,2)=2; for n >= 3, T(n,1)=prime(n) and for k=2,3,...,n, T(n,k) = m*prime(n+1-k), where m is the least positive integer such that m*p(n+1-k) is not any T(i,j) for 1<=i<=n-1 nor any T(n,j) for j<=k-1.

Table of values

List of values

A026098 Triangular array T read by rows: T(1,1)=1, T(2,1)=3, T(2,2)=2; for n >= 3, T(n,1)=prime(n) and for k=2,3,...,n, T(n,k) = mprime(n+1-k), where m is the least positive integer such that mp(n+1-k) is not any T(i,j) for 1<=i<=n-1 nor any T(n,j) for j<=k-1.

n	a(n)
1	1
2	3
3	2
4	5
5	6
6	4
7	7
8	10
9	9
10	8
11	11
12	14
13	15
14	12
15	16
16	13
17	22
18	21
19	20
20	18
21	24
22	17
23	26
24	33
25	28
26	25
27	27
28	30
29	19
30	34
31	39
32	44
33	35
34	40
35	36
36	32
37	23
38	38
39	51
40	52
41	55
42	42
43	45
44	48
45	46
46	29
47	69
48	57
49	68
50	65
51	66
52	49
53	50
54	54
55	56
56	31
57	58
58	92
59	76
60	85
61	78
62	77
63	63
64	60
65	72
66	62
67	37
68	93
69	87
70	115
71	95
72	102
73	91
74	88
75	70
76	75
77	81
78	64