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 A186415 #17 Nov 01 2016 20:29:38
%S A186415 1,4,72,2000,68600,2667168,112698432,5053029696,236860767000,
%T A186415 11493303192800,573327757086656,29253930349198464,1521079361361956032,
%U A186415 80361335659444000000,4304087536829486400000,233271979857187430688000,12774642558686527109607000,706008965215713532853436000,39337406606398593529683000000
%N A186415 a(n) = binomial(2n,n)^3/(n+1).
%H A186415 Seiichi Manyama, <a href="/A186415/b186415.txt">Table of n, a(n) for n = 0..557</a>
%F A186415 G.f.: 3F2(1/2,1/2,1/2;1,2;64x), where 3F2(.,.,.;.,.;.) is a generalized hypergeometric series.
%F A186415 a(n) = A000888(n)*A000984(n). - _R. J. Mathar_, Feb 23 2011
%F A186415 a(n) ~ 64^n/(Pi^(3/2)*n^(5/2)). - _Ilya Gutkovskiy_, Nov 01 2016
%p A186415 A186415 := proc(n) binomial(2*n,n)^3/(n+1) ; end proc: # _R. J. Mathar_, Feb 23 2011
%t A186415 Table[Binomial[2n,n]^3/(n+1),{n,0,40}]
%o A186415 (Maxima) makelist(binomial(2*n,n)^3/(n+1),n,0,40);
%Y A186415 Cf. A000108, A002894, A000888, A002897, A186414.
%K A186415 nonn,easy
%O A186415 0,2
%A A186415 _Emanuele Munarini_, Feb 21 2011