Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101037
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101037 Triangle read by rows: T(n,1)=T(n,n)=n and for 1<k<n: T(n,k)=floor((T(n-1,k-1)+T(n-1,k))/2). +0
2
1, 2, 2, 3, 2, 3, 4, 2, 2, 4, 5, 3, 2, 3, 5, 6, 4, 2, 2, 4, 6, 7, 5, 3, 2, 3, 5, 7, 8, 6, 4, 2, 2, 4, 6, 8, 9, 7, 5, 3, 2, 3, 5, 7, 9, 10, 8, 6, 4, 2, 2, 4, 6, 8, 10, 11, 9, 7, 5, 3, 2, 3, 5, 7, 9, 11, 12, 10, 8, 6, 4, 2, 2, 4, 6, 8, 10, 12, 13, 11, 9, 7, 5, 3, 2, 3, 5, 7, 9, 11, 13, 14, 12, 10, 8, 6, 4 (list; table; graph; listen)
OFFSET

1,2

COMMENT

For n>1: sum of n-th row = A007590(n+1).

CROSSREFS

Sequence in context: A048475 A051698 A046773 this_sequence A002199 A104324 A131818

Adjacent sequences: A101034 A101035 A101036 this_sequence A101038 A101039 A101040

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 27 2004

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research