A341530 - cp's OEIS frontend

A341530 a(n) = gcd(nsigma(A003961(n)), sigma(n)A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors of n.

n	a(n)
1	1
2	1
3	2
4	1
5	2
6	36
7	4
8	5
9	1
10	2
11	2
12	36
13	2
14	24
15	120
16	1
17	2
18	9
19	4
20	2
21	8
22	4
23	6
24	180
25	1
26	18
27	4
28	168
29	2
30	360
31	2
32	7
33	12
34	2
35	336
36	117
37	2
38	12
39	4
40	10
41	2
42	288
43	4
44	364
45	30
46	24
47	6
48	36
49	19
50	3
51	360
52	18
53	6
54	72
55	56
56	120
57	16
58	2
59	2
60	360
61	2
62	16
63	4
64	1
65	12
66	144
67	4
68	2
69	60
70	336
71	2
72	45
73	2
74	6
75	10
76	12
77	264
78	72
79	4
80	2
81	11
82	2
83	6
84	2016
85	4
86	12
87	24

[1, 1, 2, 1, 2, 36, 4, 5, 1, 2, 2, 36, 2, 24, 120, 1, 2, 9, 4, 2, 8, 4, 6, 180, 1, 18, 4, 168, 2, 360, 2, 7, 12, 2, 336, 117, 2, 12, 4, 10, 2, 288, 4, 364, 30, 24, 6, 36, 19, 3, 360, 18, 6, 72, 56, 120, 16, 2, 2, 360, 2, 16, 4, 1, 12, 144, 4, 2, 60, 336, 2, 45, 2, 6, 10, 12, 264, 72, 4, 2, 11, 2, 6, 2016, 4, 12, 24]

cp's OEIS Frontend

A341530 a(n) = gcd(nsigma(A003961(n)), sigma(n)A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors of n.

Table of values

List of values

cp's OEIS Frontend

A341530 a(n) = gcd(n*sigma(A003961(n)), sigma(n)*A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors of n.

Table of values

List of values

A341530 a(n) = gcd(nsigma(A003961(n)), sigma(n)A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of divisors of n.