login
Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=3^j-2^j.
2

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

%S 5,5,19,5,65,19,19,65,19,65,665,65,2059,19,65,65,665,19,665,65,211,

%T 665,65,211,665,2059,19171,2059,1586131,65,19171,65,665,665,211,6305,

%U 19171,665,6305,665,2059,211,527345,665,6305,65,6305,211,2059,665

%N Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=3^j-2^j.

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

%t (See the program at A205000.)

%Y Cf. A205000, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 22 2012