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 A070471 #55 Jun 09 2025 22:30:07
%S A070471 0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,
%T A070471 4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,
%U A070471 2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0,1,3,2,4,0
%N A070471 a(n) = n^3 mod 5.
%C A070471 Decimal expansion of 1324/99999. - _Vincenzo Librandi_, Dec 09 2010
%H A070471 Vincenzo Librandi, <a href="/A070471/b070471.txt">Table of n, a(n) for n = 0..200</a>
%H A070471 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).
%F A070471 a(n) = n^7 mod 5 since 7 == 3 (mod 5-1).
%F A070471 G.f.: -x*(1+3*x+2*x^2+4*x^3) / ( (x-1)*(1+x+x^2+x^3+x^4) ). - _R. J. Mathar_, Dec 10 2010
%F A070471 a(n) = a(n-5). - _G. C. Greubel_, Mar 26 2016
%F A070471 a(n) = 10 - Sum_{k=1..4} a(n-k) for n > 3. - _Nicolas Bělohoubek_, Jun 03 2025
%t A070471 CoefficientList[Series[-x (1 + 3 x + 2 x^2 + 4 x^3)/((x - 1) (1 + x + x^2 + x^3 + x^4)), {x, 0, 100}], x] (* _Vincenzo Librandi_, May 21 2014 *)
%t A070471 PowerMod[Range[0, 100], 3, 5] (* _G. C. Greubel_, Mar 26 2016 *)
%t A070471 Table[If[Mod[n, 5] == 0, 0, ModularInverse[n, 5]], {n, 0, 100}] (* _Jean-François Alcover_, May 03 2017 *)
%o A070471 (Sage) [power_mod(n,3,5) for n in (0..101)] # _Zerinvary Lajos_, Oct 29 2009
%o A070471 (PARI) my(x='x+O('x^99)); concat(0, Vec(-x*(1+3*x+2*x^2+4*x^3)/((x-1)*(1+x+x^2+x^3+x^4)))) \\ _Altug Alkan_, Mar 27 2016
%o A070471 (PARI) a(n) = lift(Mod(n, 5)^3); \\ _Michel Marcus_, Jun 03 2025
%Y A070471 Cf. A010874.
%K A070471 nonn,easy
%O A070471 0,3
%A A070471 _N. J. A. Sloane_, May 12 2002