Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047859
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047859 a(n)=T(2,n), array T given by A047858. +0
3
1, 4, 11, 27, 63, 143, 319, 703, 1535, 3327, 7167, 15359, 32767, 69631, 147455, 311295, 655359, 1376255, 2883583, 6029311, 12582911, 26214399, 54525951, 113246207, 234881023, 486539263, 1006632959, 2080374783, 4294967295 (list; graph; listen)
OFFSET

0,2

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

a(n)=(n+4)*2^(n-1)-1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 17 2003

CROSSREFS

n-th difference of a(n), a(n-1), ..., a(0) is (3, 4, 5, ...).

Sequence in context: A034345 A036890 A000253 this_sequence A100335 A080869 A137229

Adjacent sequences: A047856 A047857 A047858 this_sequence A047860 A047861 A047862

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.005 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research