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 A070491 #24 Dec 18 2023 14:55:55
%S A070491 0,1,8,27,6,9,13,24,19,4,14,26,17,22,18,11,7,12,3,15,25,10,5,16,20,23,
%T A070491 2,21,28,0,1,8,27,6,9,13,24,19,4,14,26,17,22,18,11,7,12,3,15,25,10,5,
%U A070491 16,20,23,2,21,28,0,1,8,27,6,9,13,24,19,4,14,26,17,22,18,11,7,12,3,15
%N A070491 a(n) = n^3 mod 29.
%H A070491 G. C. Greubel, <a href="/A070491/b070491.txt">Table of n, a(n) for n = 0..1000</a>
%H A070491 <a href="/index/Rec#order_29">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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A070491 a(n) = a(n-29). - _G. C. Greubel_, Mar 30 2016
%t A070491 Table[Mod[n^3, 29], {n, 0, 100}] (* _Vincenzo Librandi_, Jun 19 2014 *)
%o A070491 (Sage) [power_mod(n,3,29 ) for n in range(0, 78)] # _Zerinvary Lajos_, Oct 30 2009
%o A070491 (PARI) a(n)=n^3%29 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070491 Cf. A008960.
%K A070491 nonn,easy
%O A070491 0,3
%A A070491 _N. J. A. Sloane_, May 12 2002