A384033 - cp's OEIS frontend

A384033 a(n) is the number of solutions to n = sopfr(k*sopfr(n)) where sopfr(m) is sum of prime factors of m counted with multiplicity.

n	a(n)
1	0
2	1
3	1
4	1
5	1
6	0
7	1
8	1
9	1
10	1
11	1
12	2
13	1
14	3
15	4
16	5
17	1
18	7
19	1
20	10
21	10
22	4
23	1
24	19
25	19
26	19
27	30
28	17
29	1
30	40
31	1
32	52
33	46
34	12
35	77
36	87
37	1
38	77
39	111
40	87
41	1
42	175
43	1
44	197
45	157
46	197
47	1
48	219
49	302
50	413
51	372
52	175
53	1
54	413
55	614
56	413
57	456
58	67
59	1
60	1083
61	1
62	677
63	819
64	1552
65	1552
66	1695
67	1

[0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 3, 4, 5, 1, 7, 1, 10, 10, 4, 1, 19, 19, 19, 30, 17, 1, 40, 1, 52, 46, 12, 77, 87, 1, 77, 111, 87, 1, 175, 1, 197, 157, 197, 1, 219, 302, 413, 372, 175, 1, 413, 614, 413, 456, 67, 1, 1083, 1, 677, 819, 1552, 1552, 1695, 1]

cp's OEIS Frontend

A384033 a(n) is the number of solutions to n = sopfr(k*sopfr(n)) where sopfr(m) is sum of prime factors of m counted with multiplicity.

Table of values

List of values