A159664 - cp's OEIS frontend

A159664 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11n(j) + 1 = a(j)a(j) and 13n(j) + 1 = b(j)b(j), with positive integer numbers.

n	a(n)
1	1
2	23
3	551
4	13201
5	316273
6	7577351
7	181540151
8	4349386273
9	104203730401
10	2496540143351
11	59812759710023
12	1433009692897201
13	34332419869822801
14	822545067182850023
15	19706749192518577751
16	472139435553263016001
17	11311639704085793806273
18	271007213462505788334551

[1, 23, 551, 13201, 316273, 7577351, 181540151, 4349386273, 104203730401, 2496540143351, 59812759710023, 1433009692897201, 34332419869822801, 822545067182850023, 19706749192518577751, 472139435553263016001, 11311639704085793806273, 271007213462505788334551]

cp's OEIS Frontend

A159664 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11n(j) + 1 = a(j)a(j) and 13n(j) + 1 = b(j)b(j), with positive integer numbers.

Table of values

List of values

cp's OEIS Frontend

A159664 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11*n(j) + 1 = a(j)*a(j) and 13*n(j) + 1 = b(j)*b(j), with positive integer numbers.

Table of values

List of values

A159664 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11n(j) + 1 = a(j)a(j) and 13n(j) + 1 = b(j)b(j), with positive integer numbers.