A238690 - cp's OEIS frontend

A238690 Let each integer m (1 <= m <= n) be factorized as m = prime_m(1)prime_m(2)...*prime_m(bigomega(m)), with the primes sorted in nonincreasing order. Then a(n) is the number of values of m such that each prime_m(i) <= prime_n(i).

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

[1, 2, 3, 3, 4, 5, 5, 4, 6, 7, 6, 7, 7, 9, 9, 5, 8, 9, 9, 10, 12, 11, 10, 9, 10, 13, 10, 13, 11, 14, 12, 6, 15, 15, 14, 12, 13, 17, 18, 13, 14, 19, 15, 16, 16, 19, 16, 11, 15, 16, 21, 19, 17, 14, 18, 17, 24, 21, 18, 19, 19, 23, 22, 7, 22, 24, 20, 22, 27, 23, 21]

cp's OEIS Frontend

A238690 Let each integer m (1 <= m <= n) be factorized as m = prime_m(1)prime_m(2)...*prime_m(bigomega(m)), with the primes sorted in nonincreasing order. Then a(n) is the number of values of m such that each prime_m(i) <= prime_n(i).

Table of values

List of values

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

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

cp's OEIS Frontend

A238690 Let each integer m (1 <= m <= n) be factorized as m = prime_m(1)*prime_m(2)*...*prime_m(bigomega(m)), with the primes sorted in nonincreasing order. Then a(n) is the number of values of m such that each prime_m(i) <= prime_n(i).

Table of values

List of values

A238690 Let each integer m (1 <= m <= n) be factorized as m = prime_m(1)prime_m(2)...*prime_m(bigomega(m)), with the primes sorted in nonincreasing order. Then a(n) is the number of values of m such that each prime_m(i) <= prime_n(i).

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