A159681 - cp's OEIS frontend

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

n	a(n)
1	0
2	24
3	3432
4	487344
5	69199440
6	9825833160
7	1395199109304
8	198108447688032
9	28130004372591264
10	3994262512460271480
11	567157146764985958920
12	80532320578115545895184
13	11435022364945642531157232
14	1623692643501703123878431784
15	230552920354876897948206156120

[0, 24, 3432, 487344, 69199440, 9825833160, 1395199109304, 198108447688032, 28130004372591264, 3994262512460271480, 567157146764985958920, 80532320578115545895184, 11435022364945642531157232, 1623692643501703123878431784, 230552920354876897948206156120]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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