%I A032523
%S A032523 4,9,1,30,40,32,2,44,130,100,276,55,28,13,3,78,647,137,140,180,214,83,
%T A032523 203,91,791,112,574,175,243,147,878,455,531,421,1008,594,784,3041,721,
%U A032523 1872,754,119,492,429,81,3200,825,283,3027,465,1437,3384,1547,1864,446
%N A032523 Index of first occurrence of n as a term in A001203, the continued fraction 
               for Pi.
%C A032523 Until it is proved that every integer n>0 does occur in A001203, we should 
               tacitly understand a convention like "A032523(n) = 0 if n does not 
               occur in A001203". - M. F. Hasler, Mar 31 2008
%H A032523 M. F. Hasler (using data from H. Havermann), <a href="b032523.txt">Table 
               of n, a(n) for n=1,...,3131</a>.
%H A032523 H. Havermann, <a href="http://chesswanks.com/pxp/cfpifoi.html">3131 terms 
               of a trivial variation (first term of pi excluded) of A032523</a>
%H A032523 Eric Weisstein, <a href="http://mathworld.wolfram.com/PiContinuedFraction.html">
               Continued fraction of Pi</a>
%F A032523 A032523(n) = min { k | A001203(k)=n }. - M. F. Hasler, Mar 31 2008
%o A032523 (PARI) default( realprecision, 15000); v=contfrac(Pi); a(n) = for( i=1,
               #v, v[i]==n && return(i)) \\ - W. Meeussen, simplified by M. F. Hasler, 
               Mar 31 2008
%Y A032523 Cf. A001203, A107892, A138758, A138759.
%Y A032523 Sequence in context: A152205 A129861 A055491 this_sequence A032760 A129970 
               A006830
%Y A032523 Adjacent sequences: A032520 A032521 A032522 this_sequence A032524 A032525 
               A032526
%K A032523 nonn,nice
%O A032523 1,1
%A A032523 Wouter Meeussen (wouter.meeussen(AT)pandora.be)
%E A032523 Edited by M. F. Hasler (www.univ-ag.fr/~mhasler), Mar 31 2008