A290965 - cp's OEIS frontend

A290965 Let n = p1^e1...pj^ej...pm^em be the prime factorization of n > 1, with the primes in increasing order and ej > 0. If for some j < m the sum p1^2 + ... + pj^2 > p(j+1), then n is in the sequence.

n	a(n)
1	6
2	12
3	15
4	18
5	21
6	24
7	30
8	35
9	36
10	42
11	45
12	48
13	54
14	55
15	60
16	63
17	65
18	66
19	70
20	72
21	75
22	77
23	78
24	84
25	85
26	90
27	91
28	95
29	96
30	102
31	105
32	108
33	110
34	114
35	115
36	119
37	120
38	126
39	130
40	132
41	133
42	135
43	138
44	140
45	143
46	144
47	147
48	150
49	154
50	156
51	161
52	162
53	165
54	168
55	170
56	174
57	175
58	180
59	182
60	186
61	187
62	189
63	190
64	192
65	195
66	198
67	203

[6, 12, 15, 18, 21, 24, 30, 35, 36, 42, 45, 48, 54, 55, 60, 63, 65, 66, 70, 72, 75, 77, 78, 84, 85, 90, 91, 95, 96, 102, 105, 108, 110, 114, 115, 119, 120, 126, 130, 132, 133, 135, 138, 140, 143, 144, 147, 150, 154, 156, 161, 162, 165, 168, 170, 174, 175, 180, 182, 186, 187, 189, 190, 192, 195, 198, 203]

cp's OEIS Frontend

A290965 Let n = p1^e1...pj^ej...pm^em be the prime factorization of n > 1, with the primes in increasing order and ej > 0. If for some j < m the sum p1^2 + ... + pj^2 > p(j+1), then n is in the sequence.

Table of values

List of values

n	a(n)
1	6
2	12
3	15
4	18
5	21
6	24
7	30
8	35
9	36
10	42
11	45
12	48
13	54
14	55
15	60
16	63
17	65
18	66
19	70
20	72
21	75
22	77
23	78
24	84
25	85
26	90
27	91
28	95
29	96
30	102
31	105
32	108
33	110
34	114
35	115
36	119
37	120
38	126
39	130
40	132
41	133
42	135
43	138
44	140
45	143
46	144
47	147
48	150
49	154
50	156
51	161
52	162
53	165
54	168
55	170
56	174
57	175
58	180
59	182
60	186
61	187
62	189
63	190
64	192
65	195
66	198
67	203

n	a(n)
1	6
2	12
3	15
4	18
5	21
6	24
7	30
8	35
9	36
10	42
11	45
12	48
13	54
14	55
15	60
16	63
17	65
18	66
19	70
20	72
21	75
22	77
23	78
24	84
25	85
26	90
27	91
28	95
29	96
30	102
31	105
32	108
33	110
34	114
35	115
36	119
37	120
38	126
39	130
40	132
41	133
42	135
43	138
44	140
45	143
46	144
47	147
48	150
49	154
50	156
51	161
52	162
53	165
54	168
55	170
56	174
57	175
58	180
59	182
60	186
61	187
62	189
63	190
64	192
65	195
66	198
67	203

cp's OEIS Frontend

A290965 Let n = p1^e1*...*pj^ej*...*pm^em be the prime factorization of n > 1, with the primes in increasing order and ej > 0. If for some j < m the sum p1^2 + ... + pj^2 > p(j+1), then n is in the sequence.

Table of values

List of values

A290965 Let n = p1^e1...pj^ej...pm^em be the prime factorization of n > 1, with the primes in increasing order and ej > 0. If for some j < m the sum p1^2 + ... + pj^2 > p(j+1), then n is in the sequence.

n	a(n)
1	6
2	12
3	15
4	18
5	21
6	24
7	30
8	35
9	36
10	42
11	45
12	48
13	54
14	55
15	60
16	63
17	65
18	66
19	70
20	72
21	75
22	77
23	78
24	84
25	85
26	90
27	91
28	95
29	96
30	102
31	105
32	108
33	110
34	114
35	115
36	119
37	120
38	126
39	130
40	132
41	133
42	135
43	138
44	140
45	143
46	144
47	147
48	150
49	154
50	156
51	161
52	162
53	165
54	168
55	170
56	174
57	175
58	180
59	182
60	186
61	187
62	189
63	190
64	192
65	195
66	198
67	203