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-2 of 2 results.

A299172 Primes p such that Ramanujan number tau(p) is divisible by p-1.

Original entry on oeis.org

2, 3, 59, 107
Offset: 1

Views

Author

Seiichi Manyama, Feb 04 2018

Keywords

Comments

a(5) > 10^7.

Crossrefs

Cf. A000594, A007659, A299171, A299204, A299205.

Programs

  • Mathematica
    Select[ Prime@ Range@ 30, Mod[ RamanujanTau@#, # - 1] == 0 &] (* Robert G. Wilson v, Feb 11 2018 *)
  • PARI
    isok(p) = isprime(p) && !(ramanujantau(p) % (p-1)); \\ Michel Marcus, Feb 05 2018

A299204 a(n) = A000594(n) mod (n-1).

Original entry on oeis.org

0, 0, 1, 2, 2, 2, 4, 5, 0, 2, 9, 2, 0, 0, 1, 2, 3, 2, 2, 12, 18, 10, 22, 7, 12, 22, 2, 2, 5, 2, 11, 16, 15, 2, 31, 2, 12, 32, 3, 2, 8, 2, 27, 42, 27, 22, 9, 9, 16, 32, 32, 10, 33, 18, 0, 0, 30, 0, 29, 2, 38, 50, 28, 20, 39, 26, 48, 48, 0, 2, 4, 2, 5, 26, 35, 12
Offset: 2

Views

Author

Seiichi Manyama, Feb 05 2018

Keywords

Links

Crossrefs

Cf. A000594, A273650, A299163, A299172, A299205.

Programs

  • Mathematica
    f[n_] := Mod[RamanujanTau@n, n - 1]; Array[f, 76, 2] (* Robert G. Wilson v, Feb 07 2018 *)
  • PARI
    {a(n) = ramanujantau(n)%(n-1)}
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.