|
%I #11 Aug 25 2019 07:42:36
%S 2,9,20,21,77,169,170,114,115,464,961,1147,902,516,423,530,1829,3416,
%T 1206,2627,4818,1659,1245,7565,7372,5252,2781,5885,9265,13334,4191,
%U 3013,9590,2085,11324,19781,21352,6846,4843,5190,16289,31132,18527,28564
%N a(n) = smallest multiple of prime(n) such that a(n) +1 is a multiple of prime(n+1).
%H Amiram Eldar, <a href="/A077338/b077338.txt">Table of n, a(n) for n = 1..10000</a>
%e a(5) = 77 as prime(5) = 11,77 = 11*7 and 78 = 6*13= a multiple of prime(6).
%t Do[k = 1; While[Mod[k*Prime[n] + 1, Prime[n+1]] != 0, k++ ]; Print[k*Prime[n]], {n, 1, 50}] (* _Ryan Propper_, Jul 09 2005 *)
%K nonn
%O 1,1
%A _Amarnath Murthy_, Nov 04 2002
%E More terms from _Ryan Propper_, Jul 09 2005
|
