A190638 - cp's OEIS frontend

A190638 Numbers n such that with b=n(2n-1) two remainders x and y are defined via x = 2^(b-1) -1 mod b and y = (2n-1)^(b-1) - 1 mod b which satisfy x==y==0 (mod n) and y-x=n.

n	a(n)
1	5
2	41
3	257
4	2309
5	14621
6	48821
7	125429
8	177269
9	1595417
10	5278001
11	10596137
12	15146069
13	21523361
14	63993929
15	83629517
16	111321257
17	363526421
18	375805589
19	427518041
20	446072909
21	552010829
22	752665649
23	1980098177

[5, 41, 257, 2309, 14621, 48821, 125429, 177269, 1595417, 5278001, 10596137, 15146069, 21523361, 63993929, 83629517, 111321257, 363526421, 375805589, 427518041, 446072909, 552010829, 752665649, 1980098177]

cp's OEIS Frontend

A190638 Numbers n such that with b=n(2n-1) two remainders x and y are defined via x = 2^(b-1) -1 mod b and y = (2n-1)^(b-1) - 1 mod b which satisfy x==y==0 (mod n) and y-x=n.

Table of values

List of values

cp's OEIS Frontend

A190638 Numbers n such that with b=n*(2n-1) two remainders x and y are defined via x = 2^(b-1) -1 mod b and y = (2*n-1)^(b-1) - 1 mod b which satisfy x==y==0 (mod n) and y-x=n.

Table of values

List of values

A190638 Numbers n such that with b=n(2n-1) two remainders x and y are defined via x = 2^(b-1) -1 mod b and y = (2n-1)^(b-1) - 1 mod b which satisfy x==y==0 (mod n) and y-x=n.