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.
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.
Terms
- a(0) =1a(1) =23a(2) =551a(3) =13201a(4) =316273a(5) =7577351a(6) =181540151a(7) =4349386273a(8) =104203730401
External references
- oeis: A159664