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 A070514 #48 Dec 18 2023 17:25:39 %S A070514 0,1,6,1,6,5,6,1,6,1,0,1,6,1,6,5,6,1,6,1,0,1,6,1,6,5,6,1,6,1,0,1,6,1, %T A070514 6,5,6,1,6,1,0,1,6,1,6,5,6,1,6,1,0,1,6,1,6,5,6,1,6,1,0,1,6,1,6,5,6,1, %U A070514 6,1,0,1,6,1,6,5,6,1,6,1,0,1,6,1,6,5,6,1,6,1,0,1,6,1,6,5,6,1,6,1,0 %N A070514 Final digit of n^4: a(n) = n^4 mod 10. %C A070514 Decimal expansion of 538853870/3333333333. - _Alexander R. Povolotsky_, Mar 09 2013 %H A070514 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 1). %F A070514 a(n) = n^k mod 10; for k > 0 where k mod 4 = 0. - _Doug Bell_, Jun 15 2015 %F A070514 From _G. C. Greubel_, Apr 01 2016: (Start) %F A070514 a(n) = a(n-10). %F A070514 a(2*n) = 6*A011558(n). %F A070514 G.f.: (x +6*x^2 +x^3 +6*x^4 +5*x^5 +6*x^6 +x^7 +6*x^8 +x^9)/(1 - x^10). (End) %p A070514 A070514:=n->n^4 mod 10: seq(A070514(n), n=0..100); # _Wesley Ivan Hurt_, Apr 01 2016 %t A070514 LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 1}, {0, 1, 6, 1, 6, 5, 6, 1, 6, 1}, 100] (* _Vincenzo Librandi_, Jun 16 2015 *) %t A070514 PowerMod[Range[0, 100], 4, 10] (* _G. C. Greubel_, Apr 01 2016 *) %o A070514 (Sage) [power_mod(n,4,10)for n in range(0, 101)] # _Zerinvary Lajos_, Oct 30 2009 %o A070514 (Magma) [n^4 mod (10): n in [0..80]]; // _Vincenzo Librandi_, Jun 16 2015 %o A070514 (PARI) vector(100,n,n--;n^4%10) \\ _Derek Orr_, Jun 16 2015 %Y A070514 Cf. A010879, A008959, A008960. - _Doug Bell_, Jun 15 2015 %K A070514 nonn,base %O A070514 0,3 %A A070514 _N. J. A. Sloane_, May 13 2002