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 A071337 #17 Apr 21 2019 09:55:41
%S A071337 2,4,4,16,12,12,33,12,120,134,1818,1728,192,9464,9792,5400,46080,
%T A071337 62464,252000,66528,16128,182400,631104,4104000,11289600,10368000,
%U A071337 6002304,48117888,305910000,39280640,5686200,152409600,1866240,233625600
%N A071337 Product of terms of continued fraction expansion of (3/2)^n.
%C A071337 What is the rate of growth of this sequence?
%D A071337 S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 192-199.
%H A071337 Alois P. Heinz, <a href="/A071337/b071337.txt">Table of n, a(n) for n = 1..1000</a>
%H A071337 Steven R. Finch, <a href="/FinchPwrs32.html">Powers of 3/2 Modulo One</a> [From Steven Finch, Apr 20 2019]
%H A071337 Steven R. Finch, <a href="/FinchWaring.html">Non-Ideal Waring's Problem</a> [From Steven Finch, Apr 20 2019]
%H A071337 Jeff Lagarias, <a href="http://www.cecm.sfu.ca/organics/papers/lagarias/">3x+1 Problem</a>
%e A071337 a(3) = 4 since frac((3/2)^3) = [0;2,1,2] and a(3) = 2 * 1 * 2.
%o A071337 (PARI) a(n) = {cf = contfrac((3/2)^n); return (prod(i=2, #cf, cf[i]));} \\ _Michel Marcus_, Aug 01 2013
%Y A071337 Cf. A002379.
%K A071337 nonn
%O A071337 1,1
%A A071337 _Paul D. Hanna_, Jun 11 2002