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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126995 a(n) = binomial(prime(n+2), 3). 7
 1, 10, 35, 165, 286, 680, 969, 1771, 3654, 4495, 7770, 10660, 12341, 16215, 23426, 32509, 35990, 47905, 57155, 62196, 79079, 91881, 113564, 147440, 166650, 176851, 198485, 209934, 234136, 333375, 366145, 419220, 437989, 540274, 562475, 632710, 708561, 762355 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 FORMULA a(n) ~ (n log n)^3 / 6. - Charles R Greathouse IV, May 10 2017 MATHEMATICA Table[Binomial[Prime[n + 2], Prime[2]], {n, 1, 40}] Table[Binomial[Prime[n], 3], {n, 3, 40}] (* Vincenzo Librandi, May 10 2017 *) PROG (Magma) [Binomial(NthPrime(n), 3): n in [3..40]]; // Vincenzo Librandi, May 10 2017 (PARI) a(n)=binomial(prime(n+2), 3) \\ Charles R Greathouse IV, May 10 2017 (Sage) [binomial(nth_prime(n+2), 3) for n in (1..40)] # G. C. Greubel, May 29 2019 CROSSREFS Cf. A008837, A058077, A125550, A126993, A126994, A126996, A126997, A126998. Sequence in context: A221907 A195269 A070755 * A271732 A219295 A000820 Adjacent sequences: A126992 A126993 A126994 * A126996 A126997 A126998 KEYWORD nonn,easy AUTHOR Artur Jasinski, Jan 01 2007 EXTENSIONS Missing n=0 term added by N. J. A. Sloane, May 17 2020 STATUS approved

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

Last modified November 30 02:28 EST 2022. Contains 358431 sequences. (Running on oeis4.)