|
%I #8 Jul 11 2023 07:45:11
%S 3,7,47,157,293,1807,8697,9447,15147,31497,74847,159111,1031187,
%T 1100457,1740087,3589707,8498937,10312173,15086925,51874335,54072205,
%U 746239895,1433920655,11288282053
%N a(1) = 3; for n > 1, choose a(n) to be the smallest number such that a(n) > a(n-1) and (a(n)*a(n-1)+1) mod (a(n)+a(n-1)+1) = 0.
%C Starting with a(1) = 0, 1 or 2 there are no solutions.
%e a(3) = 47 because 7*47 + 1 = 330 and 7+47+1 = 55 and 55*6 = 330
%K nonn,more
%O 1,1
%A Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 15 2001
%E More terms from _Vladeta Jovovic_, Oct 18 2001
%E a(24) from _Sean A. Irvine_, Jul 11 2023
|
