Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Apr 21 2019 09:55:41
%S 2,4,4,16,12,12,33,12,120,134,1818,1728,192,9464,9792,5400,46080,
%T 62464,252000,66528,16128,182400,631104,4104000,11289600,10368000,
%U 6002304,48117888,305910000,39280640,5686200,152409600,1866240,233625600
%N Product of terms of continued fraction expansion of (3/2)^n.
%C What is the rate of growth of this sequence?
%D S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 192-199.
%H Alois P. Heinz, <a href="/A071337/b071337.txt">Table of n, a(n) for n = 1..1000</a>
%H Steven R. Finch, <a href="/FinchPwrs32.html">Powers of 3/2 Modulo One</a> [From Steven Finch, Apr 20 2019]
%H Steven R. Finch, <a href="/FinchWaring.html">Non-Ideal Waring's Problem</a> [From Steven Finch, Apr 20 2019]
%H Jeff Lagarias, <a href="http://www.cecm.sfu.ca/organics/papers/lagarias/">3x+1 Problem</a>
%e a(3) = 4 since frac((3/2)^3) = [0;2,1,2] and a(3) = 2 * 1 * 2.
%o (PARI) a(n) = {cf = contfrac((3/2)^n); return (prod(i=2, #cf, cf[i]));} \\ _Michel Marcus_, Aug 01 2013
%Y Cf. A002379.
%K nonn
%O 1,1
%A _Paul D. Hanna_, Jun 11 2002