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!)
A027151 a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A027144. 2

%I #10 Oct 20 2019 07:09:04

%S 1,3,7,21,45,135,291,873,1881,5643,12159,36477,78597,235791,508059,

%T 1524177,3284145,9852435,21229047,63687141,137226717,411680151,

%U 887047443,2661142329,5733964809,17201894427,37064931183,111194793549,239591481525,718774444575

%N a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A027144.

%H Colin Barker, <a href="/A027151/b027151.txt">Table of n, a(n) for n = 0..1000</a>

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

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

%F a(n) = 6*a(n-2) + 3*a(n-4) for n>3. - _Colin Barker_, Jan 18 2018

%o (PARI) Vec((1 + 3*x)*(1 + x^2) / (1 - 6*x^2 - 3*x^4) + O(x^40)) \\ _Colin Barker_, Jan 18 2018

%Y Cf. A141041 (bisection), A287811 (bisection).

%K nonn,easy

%O 0,2

%A _Clark Kimberling_

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 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)