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

A299171 Primes p such that Ramanujan number tau(p) is divisible by p+1.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 47, 53, 59, 71, 79, 83, 89, 97, 107, 127, 137, 139, 149, 167, 179, 191, 199, 223, 229, 239, 251, 269, 293, 349, 359, 367, 383, 419, 431, 449, 479, 499, 503, 587, 593, 599, 643, 647, 719, 809, 827, 839, 863, 881, 919
Offset: 1

Views

Author

Seiichi Manyama, Feb 04 2018

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Range[1000], PrimeQ[#] && Divisible[RamanujanTau[#], #+1] &] (* Amiram Eldar, Apr 14 2021 *)
  • 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

Crossrefs

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)}

A299205 Numbers k such that k-1 divides tau(k), where tau(k) = A000594(k) is Ramanujan's tau function.

Original entry on oeis.org

2, 3, 10, 14, 15, 56, 57, 59, 70, 85, 105, 107, 116, 136, 209, 267, 295, 323, 352, 393, 415, 442, 530, 551, 645, 646, 760, 855, 1197, 1288, 1342, 1415, 1472, 1496, 1625, 1765, 1953, 2002, 2255, 2485, 2847, 2945, 3039, 3382, 3591, 3745, 3905, 4233, 4264, 4313
Offset: 1

Views

Author

Seiichi Manyama, Feb 05 2018

Keywords

Comments

Numbers k such that A299204(k) = 0.

Crossrefs

For the sequence when n is prime see A299172.

Programs

  • Mathematica
    Select[Range[2, 5000], Divisible[RamanujanTau[#], #-1] &] (* Amiram Eldar, Jan 10 2025 *)
  • PARI
    isok(n) = (ramanujantau(n) % (n-1)) == 0; \\ Michel Marcus, Feb 05 2018
Showing 1-3 of 3 results.