login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074556 a(n) = 3^n + 6^n + 8^n. 1

%I #21 Sep 08 2022 08:45:07

%S 3,17,109,755,5473,40787,309529,2379275,18463393,144315107,1134267049,

%T 8952908795,70896790513,562818102227,4476415458169,35654571422315,

%U 284296129664833,2268726602270147,18115958853570889,144724548978127835

%N a(n) = 3^n + 6^n + 8^n.

%H Vincenzo Librandi, <a href="/A074556/b074556.txt">Table of n, a(n) for n = 0..300</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (17,-90,144).

%F From _Mohammad K. Azarian_, Dec 30 2008: (Start)

%F G.f.: 1/(1-3*x) + 1/(1-6*x) + 1/(1-8*x).

%F E.g.f.: e^(3*x) + e^(6*x) + e^(8*x). (End)

%F a(n) = 17*a(n-1) - 90*a(n-2) + 144*a(n-3); a(0)=3, a(1)=17, a(2)=109. - _Harvey P. Dale_, May 19 2011

%t Table[3^n + 6^n + 8^n, {n, 0, 20}]

%t LinearRecurrence[{17,-90,144},{3,17,109},21] (* _Harvey P. Dale_, May 19 2011 *)

%o (Magma) [3^n + 6^n + 8^n: n in [0..20]]; // _Vincenzo Librandi_, May 20 2011

%Y Cf. A001550, A001576, A034513, A001579, A074501-A074580.

%K easy,nonn

%O 0,1

%A _Robert G. Wilson v_, Aug 23 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)