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 A307810 #23 May 13 2021 02:35:36
%S A307810 1,100,13924,2371600,453093796,92598490000,19745403216400,
%T A307810 4333667896360000,971177275449892900,221106619001508490000,
%U A307810 50967394891692703241104,11866732390447357481358400,2785834789480617203561744656,658549235163074008904405646400
%N A307810 Expansion of 1/AGM(1-64*x, sqrt((1-16*x)*(1-256*x))).
%C A307810 See A246923.
%C A307810 Also the squares of coefficients in g.f. 1/sqrt((1-4*x)*(1-16*x)).
%H A307810 Seiichi Manyama, <a href="/A307810/b307810.txt">Table of n, a(n) for n = 0..416</a>
%F A307810 a(n) = A307695(n)^2 = (Sum_{k=0..n} 4^(n-k)*3^k*binomial(n,k)*binomial(2k,k))^2 = (Sum_{k=0..n} 16^(n-k)*(-3)^k*binomial(n,k)*binomial(2k,k))^2.
%F A307810 a(n) ~ 2^(8*n+2) / (3*Pi*n). - _Vaclav Kotesovec_, Sep 27 2019
%t A307810 a[n_] := Sum[4^(n-k) * 3^k * Binomial[n, k] * Binomial[2*k, k], {k, 0, n}]^2; Array[a, 14, 0] // Flatten (* _Amiram Eldar_, May 13 2021 *)
%o A307810 (PARI) N=20; x='x+O('x^N); Vec(1/agm(1-64*x, sqrt((1-16*x)*(1-256*x))))
%o A307810 (PARI) {a(n) = sum(k=0, n, 4^(n-k)*3^k*binomial(n, k)*binomial(2*k, k))^2}
%o A307810 (PARI) {a(n) = sum(k=0, n, 16^(n-k)*(-3)^k*binomial(n, k)*binomial(2*k, k))^2}
%Y A307810 Cf. A307695.
%Y A307810 (Sum_{k=0..n} c^(n-k)*e^k*binomial(n,k)*binomial(2k,k))^2 = (Sum_{k=0..n} d^(n-k)*(-e)^k*binomial(n,k)*binomial(2k,k))^2, where e = (d-c)/4: A002894 (c=0,d=4,e=1), A246467 (c=1,d=5,e=1), A246876 (c=2,d=6,e=1), A246906 (c=3,d=7,e=1), A307811 (c=5,d=9,e=1), A322240 (c=-3,d=5,e=2), A322243 (c=-1,d=7,e=2), A246923 (c=1,d=9,e=2), A248167 (c=3, d=11,e=2), A322247 (c=-1,d=11,e=3), this sequence (c=4,d=16,e=3), A322245 (c=-5,d=11,e=4), A322249 (c=-3,d=13,e=4).
%K A307810 nonn
%O A307810 0,2
%A A307810 _Seiichi Manyama_, Apr 30 2019