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 A070495 #24 Dec 18 2023 14:59:35 %S A070495 0,1,8,27,31,26,18,13,17,3,10,11,12,19,5,9,4,29,24,28,14,21,22,23,30, %T A070495 16,20,15,7,2,6,25,32,0,1,8,27,31,26,18,13,17,3,10,11,12,19,5,9,4,29, %U A070495 24,28,14,21,22,23,30,16,20,15,7,2,6,25,32,0,1,8,27,31,26,18,13,17,3 %N A070495 a(n) = n^3 mod 33. %C A070495 Equivalently: n^(10*m + 3) mod 33. - _G. C. Greubel_, Mar 30 2016 %H A070495 G. C. Greubel, <a href="/A070495/b070495.txt">Table of n, a(n) for n = 0..1000</a> %H A070495 <a href="/index/Rec#order_33">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, 0, 0, 0, 0, 1). %F A070495 a(n) = a(n-33). - _G. C. Greubel_, Mar 30 2016 %t A070495 PowerMod[Range[0, 100], 3, 33] (* _G. C. Greubel_, Mar 30 2016 *) %o A070495 (Sage) [power_mod(n,3,33) for n in range(0, 76)] # _Zerinvary Lajos_, Oct 30 2009 %o A070495 (Magma) [Modexp(n, 3, 33): n in [0..100]]; // _Vincenzo Librandi_, Mar 31 2016 %o A070495 (PARI) a(n)=n^3%33 \\ _Charles R Greathouse IV_, Apr 06 2016 %K A070495 nonn,easy %O A070495 0,3 %A A070495 _N. J. A. Sloane_, May 12 2002