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 A070395 #24 Dec 27 2023 08:37:04 %S A070395 1,6,17,7,4,5,11,9,16,1,6,17,7,4,5,11,9,16,1,6,17,7,4,5,11,9,16,1,6, %T A070395 17,7,4,5,11,9,16,1,6,17,7,4,5,11,9,16,1,6,17,7,4,5,11,9,16,1,6,17,7, %U A070395 4,5,11,9,16,1,6,17,7,4,5,11,9,16,1,6,17,7,4,5,11,9,16,1,6,17,7,4,5,11,9 %N A070395 a(n) = 6^n mod 19. %H A070395 G. C. Greubel, <a href="/A070395/b070395.txt">Table of n, a(n) for n = 0..1000</a> %H A070395 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,1). [_R. J. Mathar_, Apr 20 2010] %F A070395 From _R. J. Mathar_, Apr 20 2010: (Start) %F A070395 a(n) = a(n-9). %F A070395 G.f.: ( -1-6*x-17*x^2-7*x^3-4*x^4-5*x^5-11*x^6-9*x^7-16*x^8 ) / ( (x-1)*(1+x+x^2)*(x^6+x^3+1) ). (End) %t A070395 PowerMod[6, Range[0, 50], 19] (* _G. C. Greubel_, Mar 18 2016 *) %o A070395 (Sage) [power_mod(6,n,19)for n in range(0,89)] # _Zerinvary Lajos_, Nov 27 2009 %o A070395 (PARI) a(n) = lift(Mod(6, 19)^n); \\ _Altug Alkan_, Mar 18 2016 %K A070395 nonn,easy %O A070395 0,2 %A A070395 _N. J. A. Sloane_, May 12 2002