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 A070339 #23 Dec 18 2023 14:31:22 %S A070339 1,2,4,8,16,32,29,23,11,22,9,18,1,2,4,8,16,32,29,23,11,22,9,18,1,2,4, %T A070339 8,16,32,29,23,11,22,9,18,1,2,4,8,16,32,29,23,11,22,9,18,1,2,4,8,16, %U A070339 32,29,23,11,22,9,18,1,2,4,8,16,32,29,23,11,22,9,18 %N A070339 a(n) = 2^n mod 35. %H A070339 G. C. Greubel, <a href="/A070339/b070339.txt">Table of n, a(n) for n = 0..1000</a> %H A070339 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). %F A070339 a(n) = a(n-12). - _G. C. Greubel_, Mar 13 2016 %t A070339 PowerMod[2, Range[0, 50], 35] (* _G. C. Greubel_, Mar 13 2016 *) %o A070339 (Sage) [power_mod(2,n,35)for n in range(0,72)] # _Zerinvary Lajos_, Nov 03 2009 %o A070339 (PARI) a(n)=lift(Mod(2,35)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A070339 (GAP) List([0..83],n->PowerMod(2,n,35)); # _Muniru A Asiru_, Jan 30 2019 %K A070339 nonn,easy %O A070339 0,2 %A A070339 _N. J. A. Sloane_, May 12 2002