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!)
A074543 a(n) = 2^n + 6^n + 9^n. 1

%I #18 Sep 08 2022 08:45:07

%S 3,17,121,953,7873,66857,578161,5063033,44726593,397498697,3547251601,

%T 31743858713,284606322913,2554926530537,22955156635441,

%U 206361317111993,1855841298824833,16694108359242377,150196195253929681

%N a(n) = 2^n + 6^n + 9^n.

%H Vincenzo Librandi, <a href="/A074543/b074543.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 (17,-84,108).

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

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

%F E.g.f.: exp(2*x) + exp(6*x) + exp(9*x). (End)

%F a(n) = 17*a(n-1) - 84*a(n-2) + 108*a(n-3); a(0)=3, a(1)=17, a(2)=121. - _Harvey P. Dale_, Feb 20 2015

%t Table[2^n + 6^n + 9^n, {n, 0, 20}]

%t LinearRecurrence[{17,-84,108},{3,17,121},30] (* _Harvey P. Dale_, Feb 20 2015 *)

%o (Magma) [2^n + 6^n + 9^n: n in [0..20]]; // _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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:24 EDT 2024. Contains 371967 sequences. (Running on oeis4.)