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 A262214 #8 Sep 17 2015 04:39:33
%S A262214 1,3,1,4,3,7,3,3,9,9,3,6,7,19,7,2,3,5,9,7,9,7,3,24,13,11,7,13,19,9,15,
%T A262214 19,5,39,3,18,5,27,19,19,7,43,9,19,7,15,7,55,49,11,13,8,11,9,7,11,13,
%U A262214 57,19,4,9,7,31,34,19,67,5,7,39,69,3,36,37,99,5,39,27,25,39,35,19,27,7,14,43,27,19,10,19,55,7,19,15,29,15,48,55,19
%N A262214 Minimum number of 4's such that n*[n; 4, ..., 4, n] = [x; ..., x] for some x, where [...] denotes simple continued fractions.
%C A262214 Sequence A213893 lists fixed points of this sequence.
%t A262214 f[m_, n_] := Block[{c, k = 1}, c[x_, y_] := ContinuedFraction[x FromContinuedFraction[Join[{x}, Table[m, {y}], {x}]]]; While[First@ c[n, k] != Last@ c[n, k], k++]; k]; f[4, #] & /@ Range[2, 120] (* _Michael De Vlieger_, Sep 16 2015 *)
%o A262214 (PARI) cf(v)={t=v[#v];forstep(i=#v-1,1,-1,t=v[i]+1/t);t}
%o A262214 A262214(n,d=4)=for(k=1,9e9,(c=contfrac(cf(vector(k+2,i,if(i>1&&i<k+2,d,n)))*n))[1]==c[#c]&&return(k))
%Y A262214 Cf. A213648, A262212 - A262220, A213900, A262211;
%Y A262214 Cf. A000057, A213891 - A213899, A261311.
%K A262214 nonn
%O A262214 2,2
%A A262214 _M. F. Hasler_, Sep 15 2015