login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A146881
A symmetrical triangle sequence of coefficients : p(x,n)=If[n == 0, 1, (x + 1)^n + Sum[(1 + Mod[Binomial[n, m], 4])*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].
0
1, 1, 1, 1, 8, 1, 1, 11, 11, 1, 1, 6, 12, 6, 1, 1, 9, 16, 16, 9, 1, 1, 12, 23, 22, 23, 12, 1, 1, 15, 25, 43, 43, 25, 15, 1, 1, 10, 30, 58, 76, 58, 30, 10, 1, 1, 13, 38, 86, 132, 132, 86, 38, 13, 1, 1, 16, 49, 122, 216, 254, 216, 122, 49, 16, 1
OFFSET
0,5
COMMENTS
Row sums are:{1, 2, 10, 24, 26, 52, 94, 168, 274, 540, 1062}.
FORMULA
p(x,n)=If[n == 0, 1, (x + 1)^n + Sum[(1 + Mod[Binomial[n, m], 4])*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]]; t(n,m)=coefficients(p(x,n)).
EXAMPLE
{1}, {1, 1}, {1, 8, 1}, {1, 11, 11, 1}, {1, 6, 12, 6, 1}, {1, 9, 16, 16, 9, 1}, {1, 12, 23, 22, 23, 12, 1}, {1, 15, 25, 43, 43, 25, 15, 1}, {1, 10, 30, 58, 76, 58, 30, 10, 1}, {1, 13, 38, 86, 132, 132, 86, 38, 13, 1}, {1, 16, 49, 122, 216, 254, 216, 122, 49, 16, 1}
MATHEMATICA
Clear[p, x, n]; p[x_, n_] = If[ n == 0, 1, (x + 1)^n +Sum[(1 + Mod[Binomial[n, m], 4])*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: A133823 A168643 A173742 * A174301 A174378 A131067
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Nov 02 2008
STATUS
approved