Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157873
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157873 Triangle T(n,m)= binomial(n,2^m) + binomial(n,2^(n - m)) read by rows. +0
1
0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 6, 2, 6, 4, 5, 10, 5, 5, 10, 5, 6, 15, 15, 0, 15, 15, 6, 7, 21, 35, 0, 0, 35, 21, 7, 8, 28, 70, 1, 0, 1, 70, 28, 8, 9, 36, 126, 9, 0, 0, 9, 126, 36, 9, 10, 45, 210, 45, 0, 0, 0, 45, 210, 45, 10 (list; table; graph; listen)
OFFSET

0,4

COMMENT

Row sums are {0, 2, 6, 12, 22, 40, 72, 126, 214, 360, 620,...}.

FORMULA

T(n,m)=binomial(n, 2^m) + binomial(n, 2^(n - m)) = T(n,n-m).

EXAMPLE

{0},

{1, 1},

{2, 2, 2},

{3, 3, 3, 3},

{4, 6, 2, 6, 4},

{5, 10, 5, 5, 10, 5},

{6, 15, 15, 0, 15, 15, 6},

{7, 21, 35, 0, 0, 35, 21, 7},

{8, 28, 70, 1, 0, 1, 70, 28, 8},

{9, 36, 126, 9, 0, 0, 9, 126, 36, 9},

{10, 45, 210, 45, 0, 0, 0, 45, 210, 45, 10}

MATHEMATICA

t[n_, m_] = Binomial[n, 2^m] + Binomial[n, 2^(n - m)];

Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}];

Flatten[%]

CROSSREFS

Sequence in context: A088676 A166872 A104055 this_sequence A022870 A131410 A080773

Adjacent sequences: A157870 A157871 A157872 this_sequence A157874 A157875 A157876

KEYWORD

nonn,tabl

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 08 2009

EXTENSIONS

Edited by the Associate Editors of the OEIS, Apr 10 2009

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research