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 A264763 #17 Sep 08 2022 08:46:14
%S A264763 1,1,2,3,5,8,8,11,14,15,19,19,23,27,30,32,32,34,36,40,41,41,42,43,45,
%T A264763 48,48,51,54,55,59,59,63,67,70,72,72,74,76,80,81,81,82,83,85,88,88,91,
%U A264763 94,95,99,99,103,107,110,112,112
%N A264763 a(0) = a(1) = 1; for n>1, a(n) = a(n-1) + (a(n-2) mod 5).
%F A264763 Empirical g.f.: (4*x^12+2*x^11-2*x^10-2*x^9+4*x^8+x^7-2*x^6+x^5+2*x^4+x^3+1) / ((x-1)^2*(x^4+x^3+x^2+x+1)*(x^8-x^6+x^4-x^2+1)). - _Colin Barker_, Nov 23 2015
%t A264763 a[0] = a[1] = 1; a[n_] := a[n] = a[n - 1] + Mod[a[n - 2], 5]; Table[a@ n, {n, 0, 60}] (* _Michael De Vlieger_, Nov 24 2015 *)
%o A264763 (PARI) first(m)=my(v=vector(m));v[1]=1;v[2]=1;for(i=3,m,v[i]=v[i-1]+v[i-2]%5);v
%o A264763 (Magma) [n le 2 select 1 else Self(n-1)+Self(n-2) mod 5: n in [1..60]]; // _Vincenzo Librandi_, Nov 24 2015
%Y A264763 Cf. A000045, A003893.
%K A264763 nonn,easy
%O A264763 0,3
%A A264763 _Anders Hellström_, Nov 23 2015