This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A028253 #17 Jul 08 2025 18:31:51
%S A028253 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 A028253 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,
%U A028253 50,51,52,53,54,55,56,57
%N A028253 n mod Fibonacci(n).
%H A028253 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A028253 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 A028253 with(combinat): [ seq( n mod fibonacci(n), n=1..80) ];
%t A028253 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 A028253 (PARI) a(n)=if(n>5,n,[0, 0, 1, 1, 0][n]) \\ _Charles R Greathouse IV_, Aug 22 2011
%Y A028253 Cf. A002708.
%K A028253 nonn,easy
%O A028253 1,6
%A A028253 _N. J. A. Sloane_