Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A155998
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A155998 Triangle read by rows: t0(n,m)=(Binomial[n, m] -(-1)^m*Binomial[n, m])/2; t(n,m)=t(n,m)+t0(n,n-m). +0
1
0, 1, 1, 0, 4, 0, 1, 3, 3, 1, 0, 8, 0, 8, 0, 1, 5, 10, 10, 5, 1, 0, 12, 0, 40, 0, 12, 0, 1, 7, 21, 35, 35, 21, 7, 1, 0, 16, 0, 112, 0, 112, 0, 16, 0, 1, 9, 36, 84, 126, 126, 84, 36, 9, 1, 0, 20, 0, 240, 0, 504, 0, 240, 0, 20, 0 (list; table; graph; listen)
OFFSET

0,5

COMMENT

Row sums are:

{0, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024,...}

FORMULA

t0(n,m)=(Binomial[n, m] -(-1)^m*Binomial[n, m])/2;

t(n,m)=t(n,m)+t0(n,n-m).

EXAMPLE

{0},

{1, 1},

{0, 4, 0},

{1, 3, 3, 1},

{0, 8, 0, 8, 0},

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

{0, 12, 0, 40, 0, 12, 0},

{1, 7, 21, 35, 35, 21, 7, 1},

{0, 16, 0, 112, 0, 112, 0, 16, 0},

{1, 9, 36, 84, 126, 126, 84, 36, 9, 1},

{0, 20, 0, 240, 0, 504, 0, 240, 0, 20, 0}

MATHEMATICA

Clear[t, n, m];

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

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

Flatten[%]

CROSSREFS

Sequence in context: A071637 A141277 A096793 this_sequence A127538 A096008 A122873

Adjacent sequences: A155995 A155996 A155997 this_sequence A155999 A156000 A156001

KEYWORD

nonn,tabl,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 01 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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research