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.
%I A126995 #20 Sep 08 2022 08:45:29
%S A126995 1,10,35,165,286,680,969,1771,3654,4495,7770,10660,12341,16215,23426,
%T A126995 32509,35990,47905,57155,62196,79079,91881,113564,147440,166650,
%U A126995 176851,198485,209934,234136,333375,366145,419220,437989,540274,562475,632710,708561,762355
%N A126995 a(n) = binomial(prime(n+2), 3).
%H A126995 Vincenzo Librandi, <a href="/A126995/b126995.txt">Table of n, a(n) for n = 0..1000</a>
%F A126995 a(n) ~ (n log n)^3 / 6. - _Charles R Greathouse IV_, May 10 2017
%t A126995 Table[Binomial[Prime[n + 2], Prime[2]], {n, 1, 40}]
%t A126995 Table[Binomial[Prime[n], 3], {n, 3, 40}] (* _Vincenzo Librandi_, May 10 2017 *)
%o A126995 (Magma) [Binomial(NthPrime(n), 3): n in [3..40]]; // _Vincenzo Librandi_, May 10 2017
%o A126995 (PARI) a(n)=binomial(prime(n+2),3) \\ _Charles R Greathouse IV_, May 10 2017
%o A126995 (Sage) [binomial(nth_prime(n+2), 3) for n in (1..40)] # _G. C. Greubel_, May 29 2019
%Y A126995 Cf. A008837, A058077, A125550, A126993, A126994, A126996, A126997, A126998.
%K A126995 nonn,easy
%O A126995 0,2
%A A126995 _Artur Jasinski_, Jan 01 2007
%E A126995 Missing n=0 term added by _N. J. A. Sloane_, May 17 2020