login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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

%I

%S 3,16,98,664,4802,36136,278498,2177464,17174402,136190536,1083566498,

%T 8638939864,68964148802,550978111336,4404154809698,35214904015864,

%U 281627607648002,2252562882278536,18018213594168098,144134262724445464

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

%H Vincenzo Librandi, <a href="/A074553/b074553.txt">Table of n, a(n) for n = 0..200</a>

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

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

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

%F E.g.f.: exp(3*x) + exp(5*x) + exp(8*x). (End)

%F a(n) = 16*a(n-1) - 79*a(n-2) + 120*a(n-3).

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

%o (MAGMA) [3^n + 5^n + 8^n: n in [0..30]]; // _Vincenzo Librandi_, Jun 13 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 03:39 EST 2020. Contains 332006 sequences. (Running on oeis4.)