cp's OEIS Frontend

A205150 s(k)-s(j), where (s(k),s(j)) is the least such pair for which n divides their difference, and s(j)=prime(j)*prime(j+1).

%I A205150 #10 Jul 23 2021 09:00:12
%S A205150 9,20,9,20,20,42,42,128,9,20,66,108,78,42,180,128,102,108,114,20,42,
%T A205150 66,230,144,850,78,108,308,29,180,62,128,66,102,2485,108,370,114,78,
%U A205150 360,246,42,215,308,180,230,893,144,294,850,102,884,636,108,1980
%N A205150 s(k)-s(j), where (s(k),s(j)) is the least such pair for which n divides their difference, and s(j)=prime(j)*prime(j+1).
%C A205150 For a guide to related sequences, see A204892.
%H A205150 Michel Marcus, <a href="/A205150/b205150.txt">Table of n, a(n) for n = 1..10000</a>
%t A205150 (See the program at A205146.)
%o A205150 (PARI) s(m) = prime(m)*prime(m+1);
%o A205150 isok(k, n) = my(sk=s(k)); for (j=1, k-1, if (!Mod(sk-s(j), n), return (j)));
%o A205150 a(n) = my(k=1, x); while (!(j=isok(k, n)), k++); s(k) - s(j); \\ _Michel Marcus_, Jul 23 2021
%Y A205150 Cf. A205146, A204892.
%K A205150 nonn
%O A205150 1,1
%A A205150 _Clark Kimberling_, Jan 25 2012