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.

Showing 1-1 of 1 results.

A175156 a(n) = 2^(n-1) mod composite(n).

Original entry on oeis.org

1, 2, 4, 8, 6, 8, 8, 8, 0, 8, 4, 11, 4, 8, 9, 8, 7, 4, 4, 0, 1, 32, 9, 32, 26, 2, 24, 8, 36, 32, 26, 32, 39, 42, 4, 20, 28, 7, 32, 8, 36, 32, 4, 2, 0, 57, 64, 60, 16, 2, 40, 60, 46, 48, 71, 50, 16, 8, 72, 32, 16, 32, 64, 8, 16, 32, 24, 35, 24
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 02 2010

Keywords

Crossrefs

Programs

  • PARI
    lista(nn) = {compo = select(n->(! isprime(n) && (n != 1)), vector(nn, i, i)); for (i = 1, #compo, print1(2^(i-1) % compo[i], ", "););} \\ Michel Marcus, Sep 11 2013

Extensions

More terms from Michel Marcus, Sep 11 2013
Showing 1-1 of 1 results.