A380750 - cp's OEIS frontend

A380750 a(n) is the smallest integer k such that kxyzw = (x + k) (y + k) (z + k) * (w + k), 0 < x <= y <= z <= w has exactly n integer solutions.

n	a(n)
1	1019
2	1559
3	1637
4	1103
5	743
6	419
7	1039
8	359
9	311
10	479
11	653
12	509
13	389
14	251
15	593
16	521
17	263
18	197
19	1061
20	131
21	353
22	269
23	239
24	167
25	89
26	179
27	337
28	113
29	139
30	83
31	181
32	229
33	934
34	898
35	277
36	151
37	103
38	554
39	1042
40	281
41	109
42	107
43	566
44	283
45	1299
46	79
47	386
48	157
49	1959
50	173
51	241

[1019, 1559, 1637, 1103, 743, 419, 1039, 359, 311, 479, 653, 509, 389, 251, 593, 521, 263, 197, 1061, 131, 353, 269, 239, 167, 89, 179, 337, 113, 139, 83, 181, 229, 934, 898, 277, 151, 103, 554, 1042, 281, 109, 107, 566, 283, 1299, 79, 386, 157, 1959, 173, 241]

cp's OEIS Frontend

A380750 a(n) is the smallest integer k such that kxyzw = (x + k) (y + k) (z + k) * (w + k), 0 < x <= y <= z <= w has exactly n integer solutions.

Table of values

List of values

cp's OEIS Frontend

A380750 a(n) is the smallest integer k such that k*x*y*z*w = (x + k) * (y + k) * (z + k) * (w + k), 0 < x <= y <= z <= w has exactly n integer solutions.

Table of values

List of values

A380750 a(n) is the smallest integer k such that kxyzw = (x + k) (y + k) (z + k) * (w + k), 0 < x <= y <= z <= w has exactly n integer solutions.