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.

A022460 a(n) = prime(3*n) mod prime(n).

Original entry on oeis.org

1, 1, 3, 2, 3, 9, 5, 13, 11, 26, 13, 3, 3, 9, 9, 11, 56, 7, 1, 68, 15, 1, 15, 3, 88, 94, 7, 5, 13, 11, 106, 110, 112, 1, 124, 140, 136, 130, 142, 140, 140, 158, 154, 164, 170, 190, 178, 158, 172, 176, 184, 194, 214, 200, 206, 208, 212, 220, 220, 226, 244
Offset: 1

Views

Author

Keywords

Programs

  • Magma
    [NthPrime(3*n) mod NthPrime(n): n in [1..90]]; // Vincenzo Librandi, Dec 09 2014
  • Mathematica
    Table[Mod[Prime[3 n], Prime[n]], {n, 100}] (* Vincenzo Librandi, Dec 09 2014 *)
  • PARI
    a(n) = prime(3*n) % prime(n); \\ Michel Marcus, Sep 30 2013
    

Formula

a(n) = A031336(n) modulo A000040(n). - Michel Marcus, Sep 30 2013