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 A070429 #21 Dec 18 2023 14:03:50 %S A070429 1,7,2,14,4,28,8,9,16,18,32,36,17,25,34,3,21,6,42,12,37,24,27,1,7,2, %T A070429 14,4,28,8,9,16,18,32,36,17,25,34,3,21,6,42,12,37,24,27,1,7,2,14,4,28, %U A070429 8,9,16,18,32,36,17,25,34,3,21,6,42,12,37,24,27,1,7,2,14,4,28,8,9,16,18,32 %N A070429 a(n) = 7^n mod 47. %H A070429 G. C. Greubel, <a href="/A070429/b070429.txt">Table of n, a(n) for n = 0..1000</a> %H A070429 <a href="/index/Rec#order_23">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, 1). %F A070429 a(n) = a(n-23). - _G. C. Greubel_, Mar 22 2016 %t A070429 PowerMod[7,Range[0,80],47] (* _Harvey P. Dale_, Jan 01 2013 *) %o A070429 (Sage) [power_mod(7,n,47)for n in range(0,80)] # _Zerinvary Lajos_, Nov 27 2009 %o A070429 (PARI) a(n)=lift(Mod(7,47)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A070429 (Magma) [Modexp(7, n, 47): n in [0..100]]; // _Bruno Berselli_, Mar 22 2016 %K A070429 nonn,easy %O A070429 0,2 %A A070429 _N. J. A. Sloane_, May 12 2002