login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A146899 A additive term polynomial as a stand alone polynomial: t0(n,m)=If[Mod[2*Binomial[n, m], 2] - Mod[Binomial[n, m], 2] == 0, Binomial[n, m]/2, Binomial[n, m] + 1]; p(x,n)=Sum[t[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]/(2*x) 0
1, 4, 4, 2, 3, 2, 6, 5, 5, 6, 3, 16, 10, 16, 3, 8, 22, 36, 36, 22, 8, 4, 14, 28, 35, 28, 14, 4, 10, 18, 42, 63, 63, 42, 18, 10, 5, 46, 60, 105, 126, 105, 60, 46, 5 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

COMMENTS

Row sums are:{1, 8, 7, 22, 48, 132, 127, 266, 558}.

FORMULA

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

EXAMPLE

{1}, {4, 4}, {2, 3, 2}, {6, 5, 5, 6}, {3, 16, 10, 16, 3}, {8, 22, 36, 36, 22, 8}, {4, 14, 28, 35, 28, 14, 4}, {10, 18, 42, 63, 63, 42, 18, 10}, {5, 46, 60, 105, 126, 105, 60, 46, 5}

MATHEMATICA

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

CROSSREFS

Sequence in context: A002581 A161778 A099655 * A031351 A068923 A103714

Adjacent sequences:  A146896 A146897 A146898 * A146900 A146901 A146902

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 13:48 EST 2012. Contains 205921 sequences.