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

This page as a plain text file.
%I A375337 #21 Apr 24 2025 08:50:18
%S A375337 1,3,10,35,330,1716,12376,75582,490314,4292145,300540195,17672631900,
%T A375337 7898654920,960566918220,1503232609098,64617565719070,109712808959985,
%U A375337 232714176627630544,13413576695470557606,5300174441392685400,873065282167813104916,13146145590943010676030
%N A375337 a(n) = binomial(prime(n), phi(prime(n) + 1)).
%F A375337 a(n) << 2^p/sqrt(p), where p = prime(n). - _Charles R Greathouse IV_, Aug 12 2024
%e A375337 a(4) = 35 because binomial(prime(4), phi(prime(4) + 1)) = binomial(7, phi(8)) = binomial(7, 4) = 35.
%t A375337 Map[Binomial[#, EulerPhi[# + 1]] &, Prime[Range[22]]] (* _Amiram Eldar_, Aug 13 2024 *)
%Y A375337 Cf. A007318, A008331.
%K A375337 nonn
%O A375337 1,2
%A A375337 _Mike Jones_, Aug 12 2024