login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

%I

%S 2,10,68,520,4112,32800,262208,2097280,16777472,134218240,1073742848,

%T 8589936640,68719480832,549755822080,4398046527488,35184372121600,

%U 281474976776192,2251799813816320,18014398509744128,144115188076380160

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

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

%H <a href="/index/Rec&#34;order_02">Index entries for linear recurrences with constant coefficients</a>, signature (10,-16).

%F a(n) = 8*a(n-1) - 2^n = 10*a(n-1) - 16*a(n-2).

%F From _Mohammad K. Azarian_, Jan 02 2009: (Start)

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

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

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

%t LinearRecurrence[{10,-16},{2,10},30] (* _Harvey P. Dale_, Jan 23 2015 *)

%o (MAGMA) [2^n + 8^n: n in [0..35]]; // _Vincenzo Librandi_, Apr 30 2011

%Y Cf. A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A007689, A063376, A063481, A074600 - A074624.

%K easy,nonn

%O 0,1

%A _Robert G. Wilson v_, Aug 25 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 October 16 06:26 EDT 2019. Contains 328050 sequences. (Running on oeis4.)