login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


a(n) = binomial(prime(n),n)/prime(n) where prime(n) = n-th prime.
1

%I #14 Jul 15 2022 09:59:46

%S 1,1,2,5,42,132,1144,3978,35530,690690,2731365,50067108,429757960,

%T 1822766520,15991836267,280086337895,4703540164785,21512315482350,

%U 360471372561300,3174207914954076,14859478810664136,248599618581498860,2209822117125283440,36246606227404101045

%N a(n) = binomial(prime(n),n)/prime(n) where prime(n) = n-th prime.

%C A prime p divides all the entries (binomial coefficients) in the p-th row of Pascal's triangle.

%F a(n) = A060604(n)/A000040(n).

%p seq(binomial(ithprime(n),n)/ithprime(n),n=1..30);

%t f[n_]:=Module[{pn=Prime[n]},Binomial[pn,n]/pn]

%t f/@Range[30] (* _Harvey P. Dale_, Feb 25 2011 *)

%o (PARI) a(n) = my(p=prime(n)); binomial(p, n)/p; \\ _Michel Marcus_, Jul 15 2022

%Y Cf. A060604, A000040.

%K nonn

%O 1,3

%A _Lekraj Beedassy_, Oct 16 2002

%E More terms from _Emeric Deutsch_, Mar 04 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 11:25 EDT 2024. Contains 376196 sequences. (Running on oeis4.)