|
%I #13 Mar 17 2022 01:13:14
%S 1,1,2,1,3,2,1,5,3,3,2,1,8,13,8,5,21,3,2,1,13,1,3,89,5,8,1,5,5,34,3,2,
%T 1,21,1,89,55,13,8,144,21,13,3,1,8,3,8,89,34,5,34,3,2,1,34,8,5,1,89,
%U 1597
%N The number s(j) such that n divides s(k)-s(j), where s(j) is the (j+1)-st Fibonacci number and k is the least positive integer for which such a j>0 exists.
%C For a guide to related sequences, see A204892.
%H G. C. Greubel, <a href="/A204927/b204927.txt">Table of n, a(n) for n = 1..1000</a>
%t (See the program at A204924.)
%Y Cf. A204924, A204925, A204892, A000045.
%K nonn
%O 1,3
%A _Clark Kimberling_, Jan 21 2012
|
