This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048478 a(n) = T(6,n), array T given by A048472. 1
 1, 8, 29, 85, 225, 561, 1345, 3137, 7169, 16129, 35841, 78849, 172033, 372737, 802817, 1720321, 3670017, 7798785, 16515073, 34865153, 73400321, 154140673, 322961409, 675282945, 1409286145, 2936012801, 6106906625, 12683575297, 26306674689, 54492397569 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS n-th difference of a(n), a(n-1), ..., a(0) is (7, 14, 21, ...). 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) = 7*n * 2^(n-1) + 1. a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3) for n>2. G.f.: (1+3*x-3*x^2) / ((1-x)*(1-2*x)^2). - Colin Barker, Feb 18 2016 PROG (MAGMA) [7*n * 2^(n-1) + 1: n in [0..30]]; // Vincenzo Librandi, Sep 23 2011 (PARI) Vec((1+3*x-3*x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ Colin Barker, Feb 18 2016 CROSSREFS Sequence in context: A046664 A055536 A131438 * A001360 A116952 A261478 Adjacent sequences:  A048475 A048476 A048477 * A048479 A048480 A048481 KEYWORD nonn,easy AUTHOR 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.