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 A243239 #30 Sep 08 2022 08:46:08
%S A243239 1,10,3,30,9,90,27,76,81,34,49,5,50,15,53,45,62,38,89,17,73,51,25,56,
%T A243239 75,71,31,19,93,57,85,74,61,28,86,84,64,58,95,77,91,37,79,14,43,42,32,
%U A243239 29,96,87,94,67,88,7,70,21,16,63,48,92,47,82,44,52,35,59,8,80,24,46,72,41,22,26,66,78,4,40,12,23,36,69,11,13,33,39,2,20,6,60,18,83,54,55,65,68
%N A243239 a(n) = 10^n mod 97.
%C A243239 a(n) is the remainder of 10^n divided by 97. Repeats after 96 terms.
%H A243239 Vincenzo Librandi, <a href="/A243239/b243239.txt">Table of n, a(n) for n = 0..1000</a>
%e A243239 For n=6, a(6)=27.
%p A243239 [seq(10^n mod 97, n=0..200)]; # _N. J. A. Sloane_, Jun 25 2014
%t A243239 Table[PowerMod[10, n, 97], {n, 0, 100}] (* _Vincenzo Librandi_, Jun 26 2014 *)
%o A243239 (Sage) [power_mod(10,n,97) for n in (0..100)] # _Bruno Berselli_, Jun 26 2014
%o A243239 (PARI) a(n)=lift(Mod(10,97)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o A243239 (Magma) [Modexp(10, n, 97): n in [0..100]]; // _Bruno Berselli_, Mar 22 2016
%K A243239 nonn,easy
%O A243239 0,2
%A A243239 _Xueshi Gao_, Jun 01 2014
%E A243239 Changed offset; made it into an infinite sequence. - _N. J. A. Sloane_, Jun 25 2014