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!)
A081193 a(n) = 6*a(n-1)-8*a(n-2) for n>1, a(0)=1, a(1)=9. 1
1, 9, 46, 204, 856, 3504, 14176, 57024, 228736, 916224, 3667456, 14674944, 58710016, 234860544, 939483136, 3758014464, 15032221696, 60129214464, 240517513216, 962071363584, 3848288075776, 15393157545984, 61572640669696 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Third binomial transform of A010687 (period 2: repeat 1,6). [Bruno Berselli, Aug 06 2013]

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (6,-8).

FORMULA

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

a(n) = 7*4^n/2-5*2^n/2.

MATHEMATICA

CoefficientList[Series[(1 + 3 x)/((1 - 2 x) (1 - 4 x)), {x, 0, 30}], x] (* Vincenzo Librandi, Aug 07 2013 *)

PROG

(Magma) [7*4^n/2-5*2^n/2: n in [0..25]]; // Vincenzo Librandi, Aug 07 2013

CROSSREFS

Sequence in context: A213749 A085385 A217152 * A250722 A250776 A054140

Adjacent sequences: A081190 A081191 A081192 * A081194 A081195 A081196

KEYWORD

nonn,easy

AUTHOR

Paul Barry, Mar 11 2003

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 8 01:51 EST 2022. Contains 358672 sequences. (Running on oeis4.)