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!)
A257970 a(1) = 1, a(2) = 2, a(3) = 5; thereafter a(n) = 2 * Sum_{k=1..n-1} a(k). 3

%I #40 Jun 29 2023 13:20:15

%S 1,2,5,16,48,144,432,1296,3888,11664,34992,104976,314928,944784,

%T 2834352,8503056,25509168,76527504,229582512,688747536,2066242608,

%U 6198727824,18596183472,55788550416,167365651248,502096953744,1506290861232,4518872583696,13556617751088

%N a(1) = 1, a(2) = 2, a(3) = 5; thereafter a(n) = 2 * Sum_{k=1..n-1} a(k).

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (3).

%F G.f.: -x*(x+1)*(x-1)^2/(3*x-1). [Corrected by _Vincenzo Librandi_, May 25 2015]

%F a(n) = 3*a(n-1) for n>=5.

%F a(n) = 16*3^(n-4) for n>=4.

%t CoefficientList[Series[(x + 1) (x - 1)^2/(1 - 3 x), {x, 0, 33}], x] (* _Vincenzo Librandi_, May 25 2015 *)

%t Join[{1,2,5},NestList[3#&,16,30]] (* _Harvey P. Dale_, Dec 20 2018 *)

%o (Magma) [1,2,5] cat [16*3^(n-4): n in [4..50]]; // _Vincenzo Librandi_, May 25 2015

%K nonn,easy,less

%O 1,2

%A _Harry Farrar_, May 15 2015

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 May 5 22:20 EDT 2024. Contains 372290 sequences. (Running on oeis4.)