cp's OEIS Frontend

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.

A036157 a(n) = 2^n mod 197.

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 128, 59, 118, 39, 78, 156, 115, 33, 66, 132, 67, 134, 71, 142, 87, 174, 151, 105, 13, 26, 52, 104, 11, 22, 44, 88, 176, 155, 113, 29, 58, 116, 35, 70, 140, 83, 166, 135, 73, 146, 95, 190, 183
Offset: 0

Views

Author

Keywords

References

  • I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.

Programs

  • GAP
    a:=List([0..70],n->PowerMod(2,n,197));; Print(a); # Muniru A Asiru, Jan 26 2019
  • Maple
    [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];
  • Mathematica
    Table[PowerMod[2,n,197],{n,0,50}]  (* Harvey P. Dale, Jan 11 2011 *)
  • PARI
    a(n)=lift(Mod(2,197)^n) \\ Charles R Greathouse IV, Mar 22 2016
    

Formula

a(n) = a(n-196). - Muniru A Asiru, Jan 27 2019