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!)
A048499 a(n) = 2^(n-1)*(6*n-10)+6. 1
1, 2, 10, 38, 118, 326, 838, 2054, 4870, 11270, 25606, 57350, 126982, 278534, 606214, 1310726, 2818054, 6029318, 12845062, 27262982, 57671686, 121634822, 255852550, 536870918, 1124073478, 2348810246, 4898947078, 10200547334, 21206401030, 44023414790 (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 (5,-8,4).

FORMULA

a(n) = T(5, n), array T given by A048494.

a(0)=1, a(1)=2, a(2)=10, a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3). - Harvey P. Dale and Vincenzo Librandi, Sep 23 2011

G.f.: (1-3*x+8*x^2) / ((1-x)*(1-2*x)^2). - Colin Barker, Aug 24 2016

PROG

(Magma) [2^(n-1)*(6*n-10)+6: n in [0..30]]; // Vincenzo Librandi, Sep 23 2011

(PARI) Vec((1-3*x+8*x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ Colin Barker, Aug 24 2016

CROSSREFS

Cf. A048494.

Sequence in context: A212881 A177173 A046241 * A119358 A110148 A281199

Adjacent sequences: A048496 A048497 A048498 * A048500 A048501 A048502

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

EXTENSIONS

Formula from Ralf Stephan, Jan 15 2004

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 6 01:03 EST 2022. Contains 358594 sequences. (Running on oeis4.)