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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048469 a(n) = T(8,n), array T given by A047858. 1
1, 10, 29, 69, 153, 329, 697, 1465, 3065, 6393, 13305, 27641, 57337, 118777, 245753, 507897, 1048569, 2162681, 4456441, 9175033, 18874361, 38797305, 79691769, 163577849, 335544313, 687865849, 1409286137, 2885681145, 5905580025, 12079595513, 24696061945 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

n-th difference of a(n), a(n-1), ..., a(0) is (9, 10, 11, ...).

LINKS

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

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

FORMULA

a(n) = 2^(n-1)*(n+16)-7. a(0)=1, a(1)=10, a(2)=29, a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3). - Vincenzo Librandi, Sep 28 2011

a(n) = 2^(n-1)*(n+16)-7. G.f.: (1+5*x-13*x^2) / ((1-x)*(1-2*x)^2). - Colin Barker, Feb 18 2016

PROG

(MAGMA) [2^(n-1)*(n+16)-7: n in [0..30]]; // Vincenzo Librandi, Sep 28 2011

CROSSREFS

Sequence in context: A068197 A079273 A271991 * A031129 A048772 A055850

Adjacent sequences:  A048466 A048467 A048468 * A048470 A048471 A048472

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 August 20 10:00 EDT 2019. Contains 326143 sequences. (Running on oeis4.)