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 A114238 #13 Sep 05 2025 02:12:09
%S A114238 1,36,825,16016,286650,4900896,81477396,1330243200,21455160012,
%T A114238 343138081000,5455289950110,86359817849760,1362899694292500,
%U A114238 21460589553110400,337374701839395000,5297540558850547200,83114164698623615700,1303247055281641470000,20427480491760087405660
%N A114238 a(n) = binomial(2+2*n, 2+n) * binomial(7+2*n, n).
%H A114238 Andrew Howroyd, <a href="/A114238/b114238.txt">Table of n, a(n) for n = 0..200</a>
%F A114238 a(n) ~ 2^(4*n+9) / (Pi*n). - _Amiram Eldar_, Sep 05 2025
%e A114238 For n=0 then C(2+2*0,2+0)*C(7+2*0,0+0) = C(2,2)*C(7,0) = 1*1 = 1.
%e A114238 For n=8 then C(2+2*8,2+8)*C(7+2*8,0+8) = C(18,10)*C(23,8) = 43758*490314 = 21455160012.
%t A114238 a[n_] := Binomial[2*n+2, 2+n] * Binomial[2*n+7, n]; Array[a, 25, 0] (* _Amiram Eldar_, Sep 05 2025 *)
%o A114238 (PARI) a(n)={binomial(2+2*n, 2+n) * binomial(7+2*n, 0+n)} \\ _Andrew Howroyd_, Nov 08 2019
%Y A114238 Cf. A062190.
%K A114238 easy,nonn,changed
%O A114238 0,2
%A A114238 _Zerinvary Lajos_, Feb 04 2006
%E A114238 Terms a(13) and beyond from _Andrew Howroyd_, Nov 08 2019