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.

A334038 a(n) = Product_{p<=n, p prime} binomial(n,p).

This page as a plain text file.
%I A334038 #28 Apr 13 2020 10:50:53
%S A334038 1,1,1,3,24,100,1800,15435,702464,13716864,163296000,1383574500,
%T A334038 109294479360,3842829083808,1159801183597056,132320316074821875,
%U A334038 8213884352593920000,327816138093181337600,167079259535068179726336,34044607357920579594754944
%N A334038 a(n) = Product_{p<=n, p prime} binomial(n,p).
%H A334038 Alois P. Heinz, <a href="/A334038/b334038.txt">Table of n, a(n) for n = 0..145</a>
%e A334038 For n=2, p=2: a(n) = C(2,2) = 1.
%e A334038 For n=3, p=2,3: a(n) = C(3,2) * C(3,3) = 3.
%e A334038 For n=4, p=2,3: a(n) = C(4,2) * C(4,3) = 24.
%p A334038 a:= n-> mul(`if`(isprime(p), binomial(n, p), 1), p=2..n):
%p A334038 seq(a(n), n=0..20);  # _Alois P. Heinz_, Apr 13 2020
%o A334038 (PARI) a(n) = prod(k=1, n, if (isprime(k), binomial(n, k), 1)); \\ _Michel Marcus_, Apr 13 2020
%o A334038 (PARI) a(n)=my(s); forprime(p=2,n, s*=binomial(n,p)); s \\ _Charles R Greathouse IV_, Apr 13 2020
%Y A334038 Cf. A000040, A001142, A010051, A121497.
%K A334038 nonn
%O A334038 0,4
%A A334038 _Om R. Patel_, Apr 13 2020