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

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

%I

%S 3,15,93,645,4737,35925,277833,2175405,17168097,136171365,1083508473,

%T 8638764765,68963621457,550976525205,4404150043113,35214889699725,

%U 281627564666817,2252562753269445,18018213207009753,144134261562708285

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

%D D. Suprijanto, I. W. Suwarno, Observation on Sums of Powers of Integers Divisible by 3k-1, Applied Mathematical Sciences, Vol. 8, 2014, no. 45, 2211 - 2217; http://dx.doi.org/10.12988/ams.2014.4139.

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

%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (15,-66,80).

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

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

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

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

%o (MAGMA) [2^n + 5^n + 8^n: n in [0..25]]; // _Vincenzo Librandi_, Jun 11 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.

Last modified January 26 01:48 EST 2020. Contains 331270 sequences. (Running on oeis4.)