A205873 - OEIS

A205873

The least number j such that 9 divides s(k)-s(j), where k(n)=A205872(n) and s(k) denotes the (k+1)-st Fibonacci number.

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

%S 3,1,5,5,10,5,10,12,8,6,1,9,4,15,2,5,10,12,13,1,9,17,11,1,9,17,22,1,9,

%T 17,22,24,2,20,3,7,4,18,5,10,12,13,21,6,16,3,7,27,8,14

%N The least number j such that 9 divides s(k)-s(j), where k(n)=A205872(n) and s(k) denotes the (k+1)-st Fibonacci number.

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

%e (See the example at A205872.)

%t (See the program at A205872.)

%Y Cf. A204890, A205872, A205840.

%K nonn

%O 1,1

%A _Clark Kimberling_, Feb 02 2012