login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036543 a(n) = T(3,n), array T given by A048471. 5
1, 9, 33, 105, 321, 969, 2913, 8745, 26241, 78729, 236193, 708585, 2125761, 6377289, 19131873, 57395625, 172186881, 516560649, 1549681953, 4649045865, 13947137601, 41841412809, 125524238433, 376572715305, 1129718145921 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

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

FORMULA

Binomial transform of A084242. Second binomial transform of periodic sequence A010688. - Paul Barry, May 23 2003

a(n) = 4*3^n-3; G.f.: (1+5*x)/((1-x)*(1-3*x)); E.g.f.: 4*exp(3*x)-3*exp(x). - Paul Barry, May 23 2003

a(0)=1, a(1)=9, a(n)=4*a(n-1)-3*a(n-2). - Harvey P. Dale, Aug 16 2011

a(n) = 3*a(n-1)+6. - Vincenzo Librandi, Nov 11 2011

a(n) = A171498(n) - 2. - Philippe Deléham, Apr 13 2013

MATHEMATICA

4*3^Range[0, 25]-3 (* or *) LinearRecurrence[{4, -3}, {1, 9}, 25] (* Harvey P. Dale, Aug 16 2011 *)

PROG

(MAGMA) [4*3^n-3: n in [0..30]]; // Vincenzo Librandi, Nov 11 2011

CROSSREFS

n-th difference of a(n), a(n-1), ..., a(0) is 2^(n+2) for n=1, 2, 3...

Sequence in context: A031880 A231765 A220165 * A147269 A147123 A147107

Adjacent sequences:  A036540 A036541 A036542 * A036544 A036545 A036546

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 02:13 EDT 2018. Contains 315247 sequences. (Running on oeis4.)