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!)
A074603 a(n) = 2^n + 8^n. 4
2, 10, 68, 520, 4112, 32800, 262208, 2097280, 16777472, 134218240, 1073742848, 8589936640, 68719480832, 549755822080, 4398046527488, 35184372121600, 281474976776192, 2251799813816320, 18014398509744128, 144115188076380160 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n) = 8*a(n-1) - 2^n = 10*a(n-1) - 16*a(n-2).
From Mohammad K. Azarian, Jan 02 2009: (Start)
G.f.: 1/(1-2*x) + 1/(1-8*x).
E.g.f.: e^(2*x) + e^(8*x). (End)
MATHEMATICA
Table[2^n + 8^n, {n, 0, 25}]
LinearRecurrence[{10, -16}, {2, 10}, 30] (* Harvey P. Dale, Jan 23 2015 *)
PROG
(Magma) [2^n + 8^n: n in [0..35]]; // Vincenzo Librandi, Apr 30 2011
CROSSREFS
Sequence in context: A152620 A152621 A147725 * A110520 A136633 A335729
KEYWORD
easy,nonn
AUTHOR
Robert G. Wilson v, Aug 25 2002
STATUS
approved

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.)