A159683 - cp's OEIS frontend

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

n	a(n)
1	0
2	16
3	1008
4	62496
5	3873760
6	240110640
7	14882985936
8	922505017408
9	57180428093376
10	3544264036771920
11	219687189851765680
12	13617061506772700256
13	844038126230055650208
14	52316746764756677612656
15	3242794261288683956334480
16	201000927453133648615125120

[0, 16, 1008, 62496, 3873760, 240110640, 14882985936, 922505017408, 57180428093376, 3544264036771920, 219687189851765680, 13617061506772700256, 844038126230055650208, 52316746764756677612656, 3242794261288683956334480, 201000927453133648615125120]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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