A159678 - cp's OEIS frontend

A159678 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2-equation problem 7n(j) + 1 = a(j)a(j) and 9n(j) + 1 = b(j)b(j) with positive integer numbers.

n	a(n)
1	1
2	17
3	271
4	4319
5	68833
6	1097009
7	17483311
8	278635967
9	4440692161
10	70772438609
11	1127918325583
12	17975920770719
13	286486814005921
14	4565813103324017
15	72766522839178351
16	1159698552323529599
17	18482410314337295233
18	294558866477073194129
19	4694459453318833810831

[1, 17, 271, 4319, 68833, 1097009, 17483311, 278635967, 4440692161, 70772438609, 1127918325583, 17975920770719, 286486814005921, 4565813103324017, 72766522839178351, 1159698552323529599, 18482410314337295233, 294558866477073194129, 4694459453318833810831]

cp's OEIS Frontend

A159678 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2-equation problem 7n(j) + 1 = a(j)a(j) and 9n(j) + 1 = b(j)b(j) with positive integer numbers.

Table of values

List of values

cp's OEIS Frontend

A159678 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2-equation problem 7*n(j) + 1 = a(j)*a(j) and 9*n(j) + 1 = b(j)*b(j) with positive integer numbers.

Table of values

List of values

A159678 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2-equation problem 7n(j) + 1 = a(j)a(j) and 9n(j) + 1 = b(j)b(j) with positive integer numbers.