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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048480 a(n) = T(8,n), array T given by A048472. 1
1, 10, 37, 109, 289, 721, 1729, 4033, 9217, 20737, 46081, 101377, 221185, 479233, 1032193, 2211841, 4718593, 10027009, 21233665, 44826625, 94371841, 198180865, 415236097, 868220929, 1811939329, 3774873601, 7851737089, 16307453953, 33822867457, 70061654017 (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) = 9*n * 2^(n-1) + 1.

a(0)=1, a(1)=10, a(2)=37, a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3). - Harvey P. Dale, Jul 09 2014

G.f.: (1+5*x-5*x^2) / ((1-x)*(1-2*x)^2). - Colin Barker, Feb 18 2016

MATHEMATICA

Table[9*n*2^(n-1)+1, {n, 0, 30}] (* or *) LinearRecurrence[{5, -8, 4}, {1, 10, 37}, 30] (* Harvey P. Dale, Jul 09 2014 *)

PROG

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

(PARI) Vec((1+5*x-5*x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ Colin Barker, Feb 18 2016

CROSSREFS

Cf. A008591 (contains n-th difference of a(n),a(n-1),...,a(0)).

Sequence in context: A047672 A200872 A212755 * A116970 A199208 A110528

Adjacent sequences:  A048477 A048478 A048479 * A048481 A048482 A048483

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

License Agreements, Terms of Use, Privacy Policy .

Last modified July 30 05:09 EDT 2016. Contains 275173 sequences.