%I #15 Jul 06 2019 10:21:07

%S 0,0,1,1,0,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,

%T 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,

%U 50,51,52,53,54,55,56,57

%N n mod Fibonacci(n).

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F a(n) = n for n>5. G.f.: -x^3*(5*x^4-7*x^3+x^2+x-1) / (x-1)^2. - _Colin Barker_, Aug 05 2013

%p with(combinat): [ seq( n mod fibonacci(n), n=1..80) ];

%t Table[Mod[n,Fibonacci[n]],{n,60}] (* or *) LinearRecurrence[{2,-1},{0,0,1,1,0,6,7},60] (* _Harvey P. Dale_, Jul 06 2019 *)

%o (PARI) a(n)=if(n>5,n,[0, 0, 1, 1, 0][n]) \\ _Charles R Greathouse IV_, Aug 22 2011

%Y Cf. A002708.

%K nonn,easy

%O 1,6

%A _N. J. A. Sloane_.