A159661 - cp's OEIS frontend

A159661 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 elements. the solutions of the 2 equations problem: 11n(j) + 1 = a(j)a(j); 13n(j) + 1 = b(j)b(j); with integer numbers.

n	a(n)
1	1
2	25
3	599
4	14351
5	343825
6	8237449
7	197354951
8	4728281375
9	113281398049
10	2714025271801
11	65023325125175
12	1557845777732399
13	37323275340452401
14	894200762393125225
15	21423495022094552999
16	513269679767876146751
17	12297048819406932969025
18	294615901985998515109849

[1, 25, 599, 14351, 343825, 8237449, 197354951, 4728281375, 113281398049, 2714025271801, 65023325125175, 1557845777732399, 37323275340452401, 894200762393125225, 21423495022094552999, 513269679767876146751, 12297048819406932969025, 294615901985998515109849]

cp's OEIS Frontend

A159661 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 elements. the solutions of the 2 equations problem: 11n(j) + 1 = a(j)a(j); 13n(j) + 1 = b(j)b(j); with integer numbers.

Table of values

List of values