A319011 - cp's OEIS frontend

A319011 Let k = A064771(n) be the n-th pseudoperfect number such that {d(i)} is a unique subset of its proper divisors that sums to k, a(n) is the least number m such that kd(i)m + 1 is prime for all d(i) in this subset so their product is a Carmichael number.

n	a(n)
1	1
2	333
3	2136
4	14
5	72765
6	49
7	9765
8	5
9	154
10	490
11	276
12	55
13	86
14	104
15	228195
16	5
17	25597845
18	264
19	220
20	181
21	24403740
22	70
23	226
24	234
25	199250835
26	215
27	358293
28	13494274080
29	49
30	70
31	14753835
32	685
33	35
34	154
35	60
36	7307904366
37	1
38	570
39	21792528
40	154
41	216
42	145
43	770
44	228
45	236

[1, 333, 2136, 14, 72765, 49, 9765, 5, 154, 490, 276, 55, 86, 104, 228195, 5, 25597845, 264, 220, 181, 24403740, 70, 226, 234, 199250835, 215, 358293, 13494274080, 49, 70, 14753835, 685, 35, 154, 60, 7307904366, 1, 570, 21792528, 154, 216, 145, 770, 228, 236]

cp's OEIS Frontend

A319011 Let k = A064771(n) be the n-th pseudoperfect number such that {d(i)} is a unique subset of its proper divisors that sums to k, a(n) is the least number m such that kd(i)m + 1 is prime for all d(i) in this subset so their product is a Carmichael number.

Table of values

List of values

cp's OEIS Frontend

A319011 Let k = A064771(n) be the n-th pseudoperfect number such that {d(i)} is a unique subset of its proper divisors that sums to k, a(n) is the least number m such that k*d(i)*m + 1 is prime for all d(i) in this subset so their product is a Carmichael number.

Table of values

List of values

A319011 Let k = A064771(n) be the n-th pseudoperfect number such that {d(i)} is a unique subset of its proper divisors that sums to k, a(n) is the least number m such that kd(i)m + 1 is prime for all d(i) in this subset so their product is a Carmichael number.