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.

A179078 a(n) = ((3^p - 3)/p) mod p where p is n-th prime.

Original entry on oeis.org

1, 2, 3, 4, 0, 11, 13, 16, 5, 16, 20, 17, 22, 6, 33, 16, 5, 39, 45, 25, 5, 4, 26, 72, 21, 53, 43, 80, 85, 12, 53, 94, 54, 135, 113, 132, 125, 32, 34, 163, 100, 147, 52, 61, 84, 46, 54, 80, 122, 103, 83, 43, 109, 87, 127, 125, 239, 129, 63, 98, 160, 223, 29, 82, 3, 68, 288, 322
Offset: 1

Views

Author

Artur Jasinski, Jun 28 2010

Keywords

Comments

a(n) = 0 where n=5 (p=11) and n=78940 (p=1006003) see A014127.

Crossrefs

Programs

  • Maple
    f:= p -> (3&^p-3 mod p^2)/p:
    seq(f(ithprime(i)),i=1..100); # Robert Israel, Nov 03 2024
  • Mathematica
    aa = {}; Do[AppendTo[aa, Mod[(3^Prime[n] - 3)/Prime[n], Prime[n]]], {n, 1, 100}]; aa (* Artur Jasinski *)