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 A038533 #21 Aug 03 2023 03:44:12
%S A038533 2,8,128,512,32768,131072,2097152,8388608,2147483648,8589934592,
%T A038533 137438953472,549755813888,35184372088832,140737488355328,
%U A038533 2251799813685248,9007199254740992,9223372036854775808,36893488147419103232,590295810358705651712,2361183241434822606848
%N A038533 Denominator of coefficients of both EllipticK/Pi and EllipticE/Pi.
%C A038533 Denominators are powers of 2 since EllipticK(x) = Pi * Sum_{n>=0} 2^(-4*n-1) * binomial(2*n,n)^2 * x^n and EllipticE(x) = Pi * Sum_{n>=0} 2^(-4*n-1) (-1)^(2*n) * binomial(2*n,n)^2 /(-2*n+1) * x^n.
%H A038533 David P. Roberts and Fernando Rodriguez Villegas, <a href="https://doi.org/10.1090/noti2491">Hypergeometric Motives</a>, Notices of the American Mathematical Society, Vol. 69, No. 6 (2022), pp. 914-929; <a href="https://arxiv.org/abs/2109.00027">arXiv preprint</a>, arXiv:2109.00027 [math.AG], 2021. See eq. (1.2), p. 914.
%H A038533 <a href="/index/Di#divseq">Index to divisibility sequences</a>.
%F A038533 a(n) = 2^(1+4*n-2*w(n)) with w(n) = A000120(n) = number of 1's in binary expansion of n.
%t A038533 a[n_] := 2^(4*n - 2*DigitCount[n, 2, 1] + 1); Array[a, 20, 0] (* _Amiram Eldar_, Aug 03 2023 *)
%o A038533 (PARI) a(n)=my(s=n); while(n>>=1, s+=n); 2<<(2*s) \\ _Charles R Greathouse IV_, Apr 07 2012
%Y A038533 Cf. A000120, A038534, A038535.
%Y A038533 Equals 2*A056982(n).
%K A038533 nonn,frac
%O A038533 0,1
%A A038533 _Wouter Meeussen_, revised Jan 03 2001