login
The number s(j) such that n divides s(k)-s(j), where s(j)=prime(j)*prime(j+1) and k is the least positive integer for which such a j exists.
2

%I #8 Mar 30 2012 18:58:10

%S 6,15,6,15,15,35,35,15,6,15,77,35,143,35,143,15,221,35,323,15,35,77,

%T 437,77,667,143,35,15,6,143,15,15,77,221,6,35,1147,323,143,77,77,35,6,

%U 15,143,437,6,77,143,667,221,15,2491,35,1147,1147,323,667,77

%N The number s(j) such that n divides s(k)-s(j), where s(j)=prime(j)*prime(j+1) and k is the least positive integer for which such a j exists.

%C For a guide to related sequences, see A204892.

%t (See the program at A205146.)

%Y Cf. A205146, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 25 2012