A159665 - cp's OEIS frontend

A159665 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	0
2	48
3	27600
4	15842400
5	9093510048
6	5219658925200
7	2996075129554800
8	1719741904705530048
9	987128857225844692800
10	566610244305730148137200
11	325233293102631879186060048
12	186683343630666392922650330400
13	107155914010709406905722103589600

[0, 48, 27600, 15842400, 9093510048, 5219658925200, 2996075129554800, 1719741904705530048, 987128857225844692800, 566610244305730148137200, 325233293102631879186060048, 186683343630666392922650330400, 107155914010709406905722103589600]

cp's OEIS Frontend

A159665 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

A159665 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

A159665 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.