%I A010903
%S A010903 3,13,56,241,1037,4462,19199,82609,355448,1529413,6580721,
%T A010903 28315366,121834667,524227237,2255632184,9705479209,41760499493,
%U A010903 179686059838,773148800711,3326685824041,14313982718072
%N A010903 Pisot sequence E(3,13), a(n)=[ a(n-1)^2/a(n-2)+1/2 ].
%C A010903 According to Boyd (Acta Arithm. 32 (1977) p 89), quoting Pisot, every 
               E(3,.) sequence satisfies a linear recurrence of at most order 3. 
               Here this is easily derived from the first terms of the sequence. 
               Sequence equals A010920 for at least the first 32600 terms and maybe 
               more. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 26 2008
%D A010903 D. W. Boyd, Some integer sequences related to the Pisot sequences, Acta 
               Arithmetica, 34 (1979), 295-305.
%D A010903 D. W. Boyd, Linear recurrence relations for some generalized Pisot sequences, 
               Advances in Number Theory ( Kingston ON, 1991) 333-340, Oxford Sci. 
               Publ., Oxford Univ. Press, New York, 1993.
%F A010903 a(n)=5a(n-1)-3a(n-2) = 3*A116415(n)-2*A116415(n-1). O.g.f.: (3-2x)/(1-5x+3x^2). 
               - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 26 2008
%Y A010903 Sequence in context: A006225 A100588 A081952 this_sequence A010920 A095934 
               A151220
%Y A010903 Adjacent sequences: A010900 A010901 A010902 this_sequence A010904 A010905 
               A010906
%K A010903 nonn
%O A010903 0,1
%A A010903 Simon Plouffe (simon.plouffe(AT)gmail.com)