%I A055850
%S A055850 1,10,29,77,202,529,1385,3626,9493,24853,65066,170345,445969,1167562,
%T A055850 3056717,8002589,20951050,54850561,143600633,375951338,984253381,
%U A055850 2576808805,6746173034,17661710297,46238957857,121055163274
%N A055850 a(n)=3a(n-1)-a(n-2); a(0)=1, a(1)=10.
%D A055850 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, 
               pps. 194-196.
%H A055850 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A055850 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A055850 a(n)={10*[((3+sqrt(5))/2)^n-((3-sqrt(5))/2)^n]-[((3+sqrt(5))/2)^(n-1)-((3-sqrt(5))/
               2)^(n-1)]}/sqrt(5).
%F A055850 G.f.(x)=(1+7x)/(1-3x+x^2).
%F A055850 Lucas(2n+1) + 6*Fibonacci(2n).
%Y A055850 Sequence in context: A079273 A048469 A048772 this_sequence A027979 A057456 
               A002422
%Y A055850 Adjacent sequences: A055847 A055848 A055849 this_sequence A055851 A055852 
               A055853
%K A055850 easy,nonn
%O A055850 0,2
%A A055850 Barry E. Williams, Jun 03 2000