%I A054477
%S A054477 1,13,64,307,1471,7048,33769,161797,775216,3714283,17796199,85266712,
%T A054477 408537361,1957420093,9378563104,44935395427,215298414031,
%U A054477 1031556674728,4942484959609,23680868123317,113461855656976
%N A054477 A Pellian-related sequence.
%D A054477 A. F. Horadam, Pell Identities, Fib. Quart., Vol. 9, No. 3, 1971, pps. 
               245-252.
%D A054477 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, 
               p. 256.
%H A054477 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A054477 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A054477 a(n)=5a(n-1)-a(n-2); a(0)=1, a(1)=13.
%F A054477 (A054477)=sqrt{21*(A002320)^2-20}; where the algebraic operations on 
               (A------) are performed from the inside - out; that is, first squared, 
               then multiplied by 21, then 20 is subtracted and finally the square 
               root is performed term-by-term.
%F A054477 G.f.: (1+8*x)/(1-5*x+x^2) [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), 
               Aug 07 2008]
%p A054477 a := n-> (Matrix([[1,-8]]). Matrix([[5,1],[ -1,0]])^(n))[1,1]; seq (a(n), 
               n=0..20); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 07 
               2008]
%Y A054477 Cf. A002320.
%Y A054477 Sequence in context: A092653 A067465 A166605 this_sequence A010820 A022705 
               A153793
%Y A054477 Adjacent sequences: A054474 A054475 A054476 this_sequence A054478 A054479 
               A054480
%K A054477 easy,nonn
%O A054477 0,2
%A A054477 Barry E. Williams, Apr 16 2000
%E A054477 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 16 2000