A205133 - OEIS

A205133

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

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

%S 1,1,6,1,1,15,1,1,6,15,6,6,15,1,15,1,28,1,28,6,45,6,45,15,66,153,1,91,

%T 91,15,91,1,120,276,15,45,153,28,6,45,190,66,190,1,1,45,231,6,6,28,15,

%U 120,325,66,66,45,6,861,378,6

%N The number s(j) such that n divides s(k)-s(j), where s(j)=j*(2*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 A205130.)

%Y Cf. A205130, A204892.

%K nonn

%O 1,3

%A _Clark Kimberling_, Jan 25 2012