Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A146880
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A146880 A symmetrical triangle sequence of coefficients : p(x,n)=If[n == 0, 1, (x + 1)^n + Sum[(1 + Mod[Binomial[n, m], 2])*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]]. +0
1
1, 1, 1, 1, 4, 1, 1, 7, 7, 1, 1, 6, 8, 6, 1, 1, 9, 12, 12, 9, 1, 1, 8, 19, 22, 19, 8, 1, 1, 11, 25, 39, 39, 25, 11, 1, 1, 10, 30, 58, 72, 58, 30, 10, 1, 1, 13, 38, 86, 128, 128, 86, 38, 13, 1, 1, 12, 49, 122, 212, 254, 212, 122, 49, 12, 1 (list; graph; listen)
OFFSET

0,5

COMMENT

Row sums are:{1, 2, 6, 16, 22, 44, 78, 152, 270, 532, 1046}.

FORMULA

p(x,n)=If[n == 0, 1, (x + 1)^n + Sum[(1 + Mod[Binomial[n, m], 2])*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]]; t(n,m)=coefficients(p(x,n)).

EXAMPLE

{1}, {1, 1}, {1, 4, 1}, {1, 7, 7, 1}, {1, 6, 8, 6, 1}, {1, 9, 12, 12, 9, 1}, {1, 8, 19, 22, 19, 8, 1}, {1, 11, 25, 39, 39, 25, 11, 1}, {1, 10, 30, 58, 72, 58, 30, 10, 1}, {1, 13, 38, 86, 128, 128, 86, 38, 13, 1}, {1, 12, 49, 122, 212, 254, 212, 122, 49, 12, 1}

MATHEMATICA

Clear[p, x, n]; p[x_, n_] = If[ n == 0, 1, (x + 1)^n +Sum[(1 + Mod[Binomial[n, m], 2])*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]]; Table[CoefficientList[FullSimplify[ExpandAll[p[x, n]]], x], {n, 0, 10}]; Flatten[%]

CROSSREFS

Sequence in context: A010321 A046550 A016521 this_sequence A152236 A157172 A131060

Adjacent sequences: A146877 A146878 A146879 this_sequence A146881 A146882 A146883

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 02 2008

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research