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.

A375337 a(n) = binomial(prime(n), phi(prime(n) + 1)).

Original entry on oeis.org

1, 3, 10, 35, 330, 1716, 12376, 75582, 490314, 4292145, 300540195, 17672631900, 7898654920, 960566918220, 1503232609098, 64617565719070, 109712808959985, 232714176627630544, 13413576695470557606, 5300174441392685400, 873065282167813104916, 13146145590943010676030
Offset: 1

Views

Author

Mike Jones, Aug 12 2024

Keywords

Examples

			a(4) = 35 because binomial(prime(4), phi(prime(4) + 1)) = binomial(7, phi(8)) = binomial(7, 4) = 35.
		

Crossrefs

Programs

  • Mathematica
    Map[Binomial[#, EulerPhi[# + 1]] &, Prime[Range[22]]] (* Amiram Eldar, Aug 13 2024 *)

Formula

a(n) << 2^p/sqrt(p), where p = prime(n). - Charles R Greathouse IV, Aug 12 2024