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 A070481 #30 Dec 18 2023 14:46:43 %S A070481 0,1,8,8,7,11,7,1,18,7,12,1,18,12,8,12,11,11,18,0,1,8,8,7,11,7,1,18,7, %T A070481 12,1,18,12,8,12,11,11,18,0,1,8,8,7,11,7,1,18,7,12,1,18,12,8,12,11,11, %U A070481 18,0,1,8,8,7,11,7,1,18,7,12,1,18,12,8,12,11,11,18,0,1,8,8,7,11,7,1,18 %N A070481 a(n) = n^3 mod 19. %H A070481 G. C. Greubel, <a href="/A070481/b070481.txt">Table of n, a(n) for n = 0..1000</a> %H A070481 <a href="/index/Rec#order_19">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). %F A070481 From _G. C. Greubel_, Mar 28 2016: (Start) %F A070481 a(n) = a(n-19). %F A070481 G.f.: (-x -8*x^2 -8*x^3 -7*x^4 -11*x^5 -7*x^6 -x^7 -18*x^8 -7*x^9 - 12*x^10 -x^11 -18*x^12 -12*x^13 -8*x^14 -12*x^15 -11*x^16 -11*x^17 - 18*x^18)/(-1 + x^19). (End) %t A070481 Table[Mod[n^3, 19], {n, 0, 100}] (* _Vincenzo Librandi_, Jun 19 2014 *) %t A070481 PowerMod[Range[0,90],3,19] (* _Harvey P. Dale_, Feb 25 2015 *) %o A070481 (Sage) [power_mod(n,3,19 )for n in range(0, 85)] # _Zerinvary Lajos_, Oct 29 2009 %o A070481 (Magma) [Modexp(n,3,19): n in [0..100]]; // _Vincenzo Librandi_, Mar 28 2016 %o A070481 (PARI) a(n)=n^3%19 \\ _Charles R Greathouse IV_, Apr 06 2016 %Y A070481 Cf. A008960. %K A070481 nonn,easy %O A070481 0,3 %A A070481 _N. J. A. Sloane_, May 12 2002