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 A071315 #16 Apr 21 2019 09:54:43 %S A071315 1,1,3,1,4,6,5,9,7,7,4,7,12,6,9,12,9,10,9,13,18,14,12,11,12,15,16,14, %T A071315 10,16,23,20,28,22,17,22,23,25,30,27,25,28,30,23,30,27,25,19,17,17,22, %U A071315 29,32,35,35,30,32,37,36,34,36,28,39,42,44,38,36,39,38,41,46,40,32,44 %N A071315 Number of terms in the continued fraction of frac((3/2)^n). %C A071315 What is the rate of growth of this sequence? %C A071315 Numerically, it seems to be linear with coefficient around 0.58. [_Charles R Greathouse IV_, Jul 29 2011] %D A071315 S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 192-199. %H A071315 Charles R Greathouse IV, <a href="/A071315/b071315.txt">Table of n, a(n) for n = 1..10000</a> %H A071315 Steven R. Finch, <a href="/FinchPwrs32.html">Powers of 3/2 Modulo One</a> [From Steven Finch, Apr 20 2019] %H A071315 Steven R. Finch, <a href="/FinchWaring.html">Non-Ideal Waring's Problem</a> [From Steven Finch, Apr 20 2019] %H A071315 Jeff Lagarias, <a href="http://www.cecm.sfu.ca/organics/papers/lagarias/">3x+1 Problem</a> %e A071315 a(3) = 3 since frac((3/2)^n) = [0;2,1,2] has 3 terms (2,1,2). %o A071315 (PARI) a(n)=my(x=(3/2)^n);#contfrac(x-floor(x))-1 \\ _Charles R Greathouse IV_, Jul 29 2011 %Y A071315 Cf. A002379. %K A071315 nonn %O A071315 1,3 %A A071315 _Paul D. Hanna_, Jun 11 2002