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 A070532 #18 Dec 18 2023 16:35:41 %S A070532 0,1,2,11,4,9,8,7,8,9,4,11,2,1,0,1,2,11,4,9,8,7,8,9,4,11,2,1,0,1,2,11, %T A070532 4,9,8,7,8,9,4,11,2,1,0,1,2,11,4,9,8,7,8,9,4,11,2,1,0,1,2,11,4,9,8,7, %U A070532 8,9,4,11,2,1,0,1,2,11,4,9,8,7,8,9,4,11,2,1,0,1,2,11,4,9,8,7,8,9,4,11,2 %N A070532 a(n) = n^4 mod 14. %C A070532 Equivalently: n^(6*m + 4) mod 14. - _G. C. Greubel_, Apr 01 2016 %H A070532 G. C. Greubel, <a href="/A070532/b070532.txt">Table of n, a(n) for n = 0..1000</a> %H A070532 <a href="/index/Rec#order_14">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). %F A070532 From _G. C. Greubel_, Apr 01 2016: (Start) %F A070532 a(n+14) = a(n). %F A070532 a(14*m) = 0. %F A070532 a(2*n) = 2*A070512(n). %F A070532 G.f.: (x +2*x^2 +11*x^3 +4*x^4 +9*x^5 +8*x^6 +7*x^7 +8*x^8 +9*x^9 +4*x^10 +11*x^11 +2*x^12 +x^13)/(1 - x^14). (End) %t A070532 PowerMod[Range[0, 100], 4, 14] (* _G. C. Greubel_, Apr 01 2016 *) %o A070532 (Sage) [power_mod(n,4,14)for n in range(0, 97)] # _Zerinvary Lajos_, Oct 31 2009 %o A070532 (Magma) [Modexp(n, 4, 14): n in [0..100]]; // _Vincenzo Librandi_, Apr 02 2016 %o A070532 (PARI) a(n)=n^4%14 \\ _Charles R Greathouse IV_, Apr 06 2016 %Y A070532 Cf. A070512. %K A070532 nonn,easy %O A070532 0,3 %A A070532 _N. J. A. Sloane_, May 13 2002