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.

A175036 a(n) = 2^(n-1) mod prime(n).

Original entry on oeis.org

1, 2, 4, 1, 5, 6, 13, 14, 3, 19, 1, 13, 37, 22, 28, 14, 46, 44, 40, 24, 4, 18, 65, 2, 96, 10, 38, 31, 66, 2, 4, 124, 34, 82, 69, 32, 75, 103, 114, 5, 36, 78, 20, 6, 135, 125, 24, 132, 12, 13, 152, 24, 16, 8, 64, 218, 37, 55, 59, 170, 15, 270, 101, 104, 142, 185, 64, 16, 243, 28, 319, 12, 63, 308, 156, 252, 193, 334, 18, 159, 375, 298, 27, 316, 292, 65, 410, 220, 236, 173, 329, 46, 76, 150, 447, 46, 320, 118, 25, 17, 206, 399, 336, 457, 150, 3, 49, 116, 392, 512, 81, 77, 113, 75, 188, 50, 131, 116, 647, 63, 68
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 02 2010

Keywords

Crossrefs

Cf. A181670.

Programs

  • Mathematica
    Table[PowerMod[2,n-1,Prime[n]],{n,200}] (* Zak Seidov, Dec 02 2010 *)

Extensions

More terms from Zak Seidov, Dec 02 2010