Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A155124
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A155124 Coefficient triangle of polynomial: p(x,m)= -(m - 1) + 2*Sum[x^k, {k, 1, m}]. +0
1
1, 0, 2, -1, 2, 2, -2, 2, 2, 2, -3, 2, 2, 2, 2, -4, 2, 2, 2, 2, 2, -5, 2, 2, 2, 2, 2, 2, -6, 2, 2, 2, 2, 2, 2, 2, -7, 2, 2, 2, 2, 2, 2, 2, 2, -8, 2, 2, 2, 2, 2, 2, 2, 2, 2, -9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; listen)
OFFSET

0,3

COMMENT

Row sums are :n;{1,2,3,4,5,6,7,8,9,10,...}

These polynomials in n are column functions for general Pascal-Sierpinki

triangles.

FORMULA

p(x,m)= -(m - 1) + 2*Sum[x^k, {k, 1, m}]; t(m,n)=coefficients(p(x,m))

EXAMPLE

{1},

{0, 2},

{-1, 2, 2},

{-2, 2, 2, 2},

{-3, 2, 2, 2, 2},

{-4, 2, 2, 2, 2, 2},

{-5, 2, 2, 2, 2, 2, 2},

{-6, 2, 2, 2, 2, 2, 2, 2},

{-7, 2, 2, 2, 2, 2, 2, 2, 2},

{-8, 2, 2, 2, 2, 2, 2, 2, 2, 2},

{-9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2}

MATHEMATICA

Clear[f, n, m]; f[n_, m_] = -(m - 1) + 2*Sum[n^k, {k, 1, m}];

Table[ExpandAll[ -(m - 1) + 2*Sum[n^k, {k, 1, m}]], {m, 1, 10}]'

Table[CoefficientList[ExpandAll[ -(m - 1) + 2*Sum[n^ k, {k, 1, m}]], n], {m, 0, 10}];

Flatten[%]

CROSSREFS

Sequence in context: A036485 A030547 A156642 this_sequence A138033 A067754 A025851

Adjacent sequences: A155121 A155122 A155123 this_sequence A155125 A155126 A155127

KEYWORD

uned,sign

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 20 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research