login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 1
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; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

CROSSREFS

Sequence in context: A051698 A046773 A175402 * A002199 A182744 A104324

Adjacent sequences:  A101034 A101035 A101036 * A101038 A101039 A101040

KEYWORD

nonn,tabl

AUTHOR

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

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 .

Last modified February 16 06:37 EST 2012. Contains 205860 sequences.