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.

A363700 a(n) = phi(2*prime(n)+1).

Original entry on oeis.org

4, 6, 10, 8, 22, 18, 24, 24, 46, 58, 36, 40, 82, 56, 72, 106, 96, 80, 72, 120, 84, 104, 166, 178, 96, 168, 132, 168, 144, 226, 128, 262, 200, 180, 264, 200, 144, 216, 264, 346, 358, 220, 382, 252, 312, 216, 276, 296, 288, 288, 466, 478, 264, 502, 408, 480, 420, 360, 288, 562
Offset: 1

Views

Author

Alain Rocchelli, Jun 16 2023

Keywords

Comments

2*prime(n)+1 is prime iff a(n) = 2*prime(n).

Crossrefs

Programs

  • Mathematica
    a[n_] := EulerPhi[2*Prime[n] + 1]; Array[a, 100] (* Amiram Eldar, Jun 16 2023 *)
  • PARI
    a(n)=eulerphi(2*prime(n)+1)

Formula

a(n) = A000010(A072055(n)).
a(n) = A037225(A000040(n)).