login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 3, 7, 21, 45, 135, 291, 873, 1881, 5643, 12159, 36477, 78597, 235791, 508059, 1524177, 3284145, 9852435, 21229047, 63687141, 137226717, 411680151, 887047443, 2661142329, 5733964809, 17201894427, 37064931183, 111194793549, 239591481525, 718774444575 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Colin Barker, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (0,6,0,3).

FORMULA

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

a(n) = 6*a(n-2) + 3*a(n-4) for n>3. - Colin Barker, Jan 18 2018

PROG

(PARI) Vec((1 + 3*x)*(1 + x^2) / (1 - 6*x^2 - 3*x^4) + O(x^40)) \\ Colin Barker, Jan 18 2018

CROSSREFS

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

Sequence in context: A329114 A018712 A183936 * A219589 A092203 A018760

Adjacent sequences:  A027148 A027149 A027150 * A027152 A027153 A027154

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 23:48 EST 2021. Contains 349415 sequences. (Running on oeis4.)