login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105084 Triangle read by rows: a[n, m] = a[n - 1, m] + binomial[n, m]; n <=m 0
1, 1, 2, 1, 5, 2, 1, 11, 6, 2, 1, 21, 16, 7, 2, 1, 36, 36, 22, 8, 2, 1, 57, 71, 57, 29, 9, 2, 1, 85, 127, 127, 85, 37, 10, 2, 1, 121, 211, 253, 211, 121, 46, 11, 2, 1, 166, 331, 463, 463, 331, 166, 56, 12, 2, 1, 221, 496, 793, 925, 793, 496, 221, 67, 13, 2, 1, 287, 716, 1288, 1717 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Triangular binomial sequence related to Pascal's triangle.
LINKS
EXAMPLE
Triangle levels:
1
1,2
1,5,2
1,11,6,2
1,21,16,7,2
1,36,36,22,8,2
1,57,71,57,29,9,2
MATHEMATICA
a[0, 0] = 1; a[1, 0] = 1; a[n_, 1] := a[n, 1] = 1; a[1, m_] := a[1, m] = 1 a[n_, m_] := a[n, m] = a[n - 1, m] + Binomial[n, m];
CROSSREFS
Sequence in context: A146023 A104766 A361681 * A126125 A221876 A128514
KEYWORD
nonn,tabl
AUTHOR
Roger L. Bagula, Apr 06 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 14:08 EDT 2024. Contains 371989 sequences. (Running on oeis4.)