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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074609 a(n) = 3^n + 8^n. 2
 2, 11, 73, 539, 4177, 33011, 262873, 2099339, 16783777, 134237411, 1073800873, 8590111739, 68720008177, 549757408211, 4398051294073, 35184386437739, 281475019757377, 2251799942825411, 18014398896902473, 144115189238117339 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Table of n, a(n) for n=0..19. Index entries for linear recurrences with constant coefficients, signature (11,-24). FORMULA From Mohammad K. Azarian, Jan 11 2009: (Start) G.f.: 1/(1-3*x) + 1/(1-8*x). E.g.f.: e^(3*x) + e^(8*x). (End) a(n) = 11*a(n-1) - 24*a(n-2) with a(0)=2, a(1)=11. - Vincenzo Librandi, Jul 21 2010 MATHEMATICA Table[3^n + 8^n, {n, 0, 25}] LinearRecurrence[{11, -24}, {2, 11}, 30] (* Harvey P. Dale, Mar 10 2015 *) CROSSREFS Cf. A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A007689, A063376, A063481, A074600..A074624. Sequence in context: A363389 A323842 A049671 * A299786 A335310 A199417 Adjacent sequences: A074606 A074607 A074608 * A074610 A074611 A074612 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.

Last modified December 6 03:51 EST 2023. Contains 367595 sequences. (Running on oeis4.)