A349169 - cp's OEIS frontend

A349169 Numbers k such that k * gcd(sigma(k), A003961(k)) is equal to the odd part of {sigma(k) * gcd(k, A003961(k))}, where A003961 shifts the prime factorization one step towards larger primes, and sigma is the sum of divisors function.

n	a(n)
1	1
2	15
3	105
4	3003
5	3465
6	13923
7	45045
8	264537
9	459459
10	745875
11	1541475
12	5221125
13	8729721
14	10790325
15	14171625
16	29288025
17	34563375
18	57034575
19	71430975
20	99201375
21	109643625
22	144729585
23	205016175
24	255835125
25	295708875
26	356080725
27	399242025
28	419159475
29	449323875
30	928602675
31	939495375
32	1083656925
33	1941623775
34	1962350685
35	2083228875

[1, 15, 105, 3003, 3465, 13923, 45045, 264537, 459459, 745875, 1541475, 5221125, 8729721, 10790325, 14171625, 29288025, 34563375, 57034575, 71430975, 99201375, 109643625, 144729585, 205016175, 255835125, 295708875, 356080725, 399242025, 419159475, 449323875, 928602675, 939495375, 1083656925, 1941623775, 1962350685, 2083228875]

cp's OEIS Frontend

A349169 Numbers k such that k * gcd(sigma(k), A003961(k)) is equal to the odd part of {sigma(k) * gcd(k, A003961(k))}, where A003961 shifts the prime factorization one step towards larger primes, and sigma is the sum of divisors function.

Table of values

List of values