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 A036146 #14 Jul 08 2025 21:35:34 %S A036146 1,2,4,8,16,32,64,128,117,95,51,102,65,130,121,103,67,134,129,119,99, %T A036146 59,118,97,55,110,81,23,46,92,45,90,41,82,25,50,100,61,122,105,71,3,6, %U A036146 12,24,48,96,53,106,73,7,14,28 %N A036146 a(n) = 2^n mod 139. %D A036146 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff. %H A036146 Muniru A Asiru, <a href="/A036146/b036146.txt">Table of n, a(n) for n = 0..1000</a> %F A036146 a(n) = a(n-138). - _Muniru A Asiru_, Jan 27 2019 %p A036146 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ]; %t A036146 PowerMod[2,Range[0,100],139] (* _Harvey P. Dale_, Dec 26 2017 *) %o A036146 (PARI) a(n)=lift(Mod(2,139)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A036146 (GAP) a:=List([0..70],n->PowerMod(2,n,139));; Print(a); # _Muniru A Asiru_, Jan 27 2019 %K A036146 nonn,easy %O A036146 0,2 %A A036146 _N. J. A. Sloane_