Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Jan 12 2023 01:38:10
%S 2,11,61,341,1921,10901,62281,358061,2070241,12030821,70231801,
%T 411625181,2420922961,14281397141,84467679721,500702562701,
%U 2973697798081,17689598897861,105374653934041,628433226338621
%N a(n) = 5^n + 6^n.
%H G. C. Greubel, <a href="/A074615/b074615.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-30).
%F From _Mohammad K. Azarian_, Jan 11 2009: (Start)
%F G.f.: 1/(1-5*x) + 1/(1-6*x).
%F E.g.f.: exp(5*x) + exp(6*x). (End)
%F a(n) = 11*a(n-1) - 30*a(n-2) with a(0)=2, a(1)=11. - _Vincenzo Librandi_, Jul 21 2010
%t Table[5^n + 6^n, {n, 0, 20}]
%o (Magma) [5^n+6^n: n in [0..30]]; // _G. C. Greubel_, Jan 11 2023
%o (SageMath) [5^n+6^n for n in range(31)] # _G. C. Greubel_, Jan 11 2023
%Y Cf. A000051, A007689, A034472, A034474, A034491, A052539, A062394.
%Y Cf. A062395, A062396, A063376, A063481, A074600 to A074624.
%K easy,nonn
%O 0,1
%A _Robert G. Wilson v_, Aug 26 2002