Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047862
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047862 a(n)=T(5,n), array T given by A047858. +0
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; listen)
OFFSET

0,2

COMMENT

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 (benoit7848c(AT)orange.fr), Jun 17 2003

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 (benoit7848c(AT)orange.fr), Jun 17 2003

CROSSREFS

n-th difference of a(n), a(n-1), ..., a(0) is (6, 7, 8, ...).

Sequence in context: A011934 A100206 A007044 this_sequence A048755 A055267 A009370

Adjacent sequences: A047859 A047860 A047861 this_sequence A047863 A047864 A047865

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research