Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A155997
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A155997 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
2, 1, 1, 2, 0, 2, 1, 3, 3, 1, 2, 0, 12, 0, 2, 1, 5, 10, 10, 5, 1, 2, 0, 30, 0, 30, 0, 2, 1, 7, 21, 35, 35, 21, 7, 1, 2, 0, 56, 0, 140, 0, 56, 0, 2, 1, 9, 36, 84, 126, 126, 84, 36, 9, 1, 2, 0, 90, 0, 420, 0, 420, 0, 90, 0, 2 (list; table; graph; listen)
OFFSET

0,1

COMMENT

Row sums are:

{2, 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

{2},

{1, 1},

{2, 0, 2},

{1, 3, 3, 1},

{2, 0, 12, 0, 2},

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

{2, 0, 30, 0, 30, 0, 2},

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

{2, 0, 56, 0, 140, 0, 56, 0, 2},

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

{2, 0, 90, 0, 420, 0, 420, 0, 90, 0, 2}

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: A089062 A039980 A055138 this_sequence A123223 A088226 A117586

Adjacent sequences: A155994 A155995 A155996 this_sequence A155998 A155999 A156000

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research