This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047862 a(n) = T(5,n), array T given by A047858. 1
 1, 7, 20, 48, 108, 236, 508, 1084, 2300, 4860, 10236, 21500, 45052, 94204, 196604, 409596, 851964, 1769468, 3670012, 7602172, 15728636, 32505852, 67108860, 138412028, 285212668, 587202556, 1207959548, 2483027964 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS More generally the main diagonal of the array defined by T(0,j)=j+1 j>=0, T(i,0)=i+1 i>=0, T(i,j)=T(i-1,j-1)+T(i-1,j)+ A, is given by T(n,n)=2^(n-1)*(n+2A+2)-A. - Benoit Cloitre, Jun 17 2003 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..3000 Index to sequences with linear recurrences with constant coefficients, signature (5,-8,4). FORMULA Main diagonal of the array defined by T(0, j)=j+1 j>=0, T(i, 0)=i+1 i>=0, T(i, j)=T(i-1, j-1)+T(i-1, j)+ 4; a(n)=2^(n-1)*(n+10)-4. - Benoit Cloitre, Jun 17 2003 a(0)=1, a(1)=7, a(2)=20, a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3). - Vincenzo Librandi, Sep 28 2011 PROG (MAGMA) [2^(n-1)*(n+10)-4: n in [0..30]]; // Vincenzo Librandi, Sep 28 2011 CROSSREFS n-th difference of a(n), a(n-1), ..., a(0) is (6, 7, 8, ...). Sequence in context: A159222 A100206 A007044 * A048755 A055267 A218843 Adjacent sequences:  A047859 A047860 A047861 * A047863 A047864 A047865 KEYWORD nonn,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .