Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156861
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156861 Triangle read by rows: t(n,k)=2^k - Binomial[n, k + 1]. +0
1
1, 0, 2, -1, 1, 4, -2, -1, 3, 8, -3, -4, 0, 7, 16, -4, -8, -6, 3, 15, 32, -5, -13, -16, -7, 10, 31, 64, -6, -19, -31, -27, -5, 25, 63, 128, -7, -26, -52, -62, -40, 4, 56, 127, 256, -8, -34, -80, -118, -110, -52, 28, 119, 255, 512, -9, -43, -116, -202, -236, -178, -56, 83 (list; table; graph; listen)
OFFSET

0,3

COMMENT

Row sums are 2^n: {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024,...}

FORMULA

t(n,k)=2^k - Binomial[n, k + 1].

EXAMPLE

{1},

{0, 2},

{-1, 1, 4},

{-2, -1, 3, 8},

{-3, -4, 0, 7, 16},

{-4, -8, -6, 3, 15, 32},

{-5, -13, -16, -7, 10, 31, 64},

{-6, -19, -31, -27, -5, 25, 63, 128},

{-7, -26, -52, -62, -40, 4, 56, 127, 256},

{-8, -34, -80, -118, -110, -52, 28, 119, 255, 512},

{-9, -43, -116, -202, -236, -178, -56, 83, 246, 511, 1024}

MATHEMATICA

t[n_, k_] = 2^k - Binomial[n, k + 1] Table[Table[t[n, k], {k, 0, n}], {n, 0, 10}] Flatten[%]

CROSSREFS

Sequence in context: A111579 A144374 A144018 this_sequence A122773 A029268 A064191

Adjacent sequences: A156858 A156859 A156860 this_sequence A156862 A156863 A156864

KEYWORD

sign,tabl,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 17 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