%I A054489
%S A054489 1,10,59,344,2005,11686,68111,396980,2313769,13485634,78600035,
%T A054489 458114576,2670087421,15562409950,90704372279,528663823724,
%U A054489 3081278570065,17959007596666,104672767009931,610077594462920
%N A054489 A second order recursive sequence.
%D A054489 I. Adler, Three Diophantine equations - Part II, Fib. Quart., 7(1969), 
               pps. 181-193.
%D A054489 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N. Y., 1964, 
               pps. 122-125, 194-196.
%D A054489 E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart., 
               7(1969), pps. 231-242.
%H A054489 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A054489 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A054489 a(n)=6a(n-1)-a(n-2), a(0)=1, a(1)=10.
%F A054489 a(n)={10*([3+2sqrt(2)]^n-[3-2sqrt(2)]^n)-([3+2sqrt(2)]^(n-1)-[3-2sqrt(2)]^(n-1))}/
               4sqrt(2).
%F A054489 G.f.: (1+4*x)/(1-6*x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Nov 03 2008]
%p A054489 a[0]:=1: a[1]:=10: for n from 2 to 26 do a[n]:=6*a[n-1]-a[n-2] od: seq(a[n], 
               n=0..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 26 
               2006
%Y A054489 Cf. A054488 and A038761.
%Y A054489 Sequence in context: A045950 A061001 A055586 this_sequence A140890 A055714 
               A046762
%Y A054489 Adjacent sequences: A054486 A054487 A054488 this_sequence A054490 A054491 
               A054492
%K A054489 easy,nonn
%O A054489 0,2
%A A054489 Barry E. Williams, May 04 2000
%E A054489 More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 05 2000