login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133648 a(n) = 2*3^n + 3^(n-1) - (n+1). 2
5, 18, 59, 184, 561, 1694, 5095, 15300, 45917, 137770, 413331, 1240016, 3720073, 11160246, 33480767, 100442332, 301327029, 903981122, 2711943403, 8135830248, 24407490785, 73222472398, 219667417239, 659002251764, 1977006755341 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..25.

Index entries for linear recurrences with constant coefficients, signature (5,-7,3).

FORMULA

O.g.f.: -x*(5-7*x+4*x^2)/((-1+x)^2*(-1+3*x)). - R. J. Mathar, Jan 07 2008

a(n) = A108765(n-1) + A108765(n). - Klaus Purath, Apr 13 2020

EXAMPLE

a(3) = 2*3^3 + 3^2 - 4 = 2*27 + 9 - 4.

MAPLE

A133648:=n->2*3^n+3^(n-1)-(n+1): seq(A133648(n), n=1..40); # Wesley Ivan Hurt, Apr 18 2017

MATHEMATICA

Table[2*3^n + 3^(n - 1) - (n + 1), {n, 1, 50}] (* Stefan Steinerberger, Sep 20 2007 *)

CROSSREFS

Cf. A000244, A108765, A133649 (inverse binomial transform).

Sequence in context: A000340 A301880 A034567 * A284968 A222567 A099449

Adjacent sequences: A133645 A133646 A133647 * A133649 A133650 A133651

KEYWORD

nonn,easy

AUTHOR

Gary W. Adamson, Sep 19 2007

STATUS

approved

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 December 2 07:55 EST 2022. Contains 358493 sequences. (Running on oeis4.)