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!)
 A155623 a(n) = 11^n + 3^n - 1. 13

%I

%S 1,13,129,1357,14721,161293,1772289,19489357,214365441,2357967373,

%T 25937483649,285311847757,3138428908161,34522713738253,

%U 379749838366209,4177248183764557,45949729906618881,505447028628433933

%N a(n) = 11^n + 3^n - 1.

%C a^n+b^n-1^n=(a+b)*a(n-1)-(a*b)*a(n-2)-(a-1)*(b-1) - _Vincenzo Librandi_, Jul 21 2010

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

%F G.f.: 1/(1 - 11*x) + 1/(1 - 3*x) - 1/(1 - x).

%F E.g.f.: exp(11*x) + exp(3*x) - exp(x).

%F a(n) = 14*a(n-1) - 33*a(n-2) - 20 for n>1, a(0)=1, a(1)=13 - _Vincenzo Librandi_, Jul 21 2010

%t LinearRecurrence[{15,-47,33},{1,13,129},20] (* _Harvey P. Dale_, Jan 14 2015 *)

%o (PARI) a(n)=11^n+3^n-1 \\ _Charles R Greathouse IV_, Jun 11 2015

%Y Cf. A155588, A155589, A155590, A155592, A155593, A155594, A155595, A155596, A155597, A155598, A155599, A155600, A155601, A155622.

%K nonn,easy

%O 0,2

%A _Mohammad K. Azarian_, Jan 29 2009

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 April 11 16:42 EDT 2021. Contains 342888 sequences. (Running on oeis4.)