Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105084
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105084 Triangle read by rows: a[n, m] = a[n - 1, m] + binomial[n, m]; n <=m +0
1
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; listen)
OFFSET

0,3

COMMENT

Triangular binomial sequence related to Pascal's triangle.

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: A146024 A146023 A104766 this_sequence A126125 A128514 A126075

Adjacent sequences: A105081 A105082 A105083 this_sequence A105085 A105086 A105087

KEYWORD

nonn,tabl

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Apr 06 2005

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research