cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A106202 Expansion of Im(x/(1 - x - 2*i*x^2)), i=sqrt(-1).

Original entry on oeis.org

0, 0, 0, 2, 4, 6, 8, 2, -20, -66, -144, -230, -236, 22, 856, 2610, 5308, 7918, 7104, -4150, -36636, -100794, -193368, -269342, -198772, 274974, 1522192, 3846778, 6966452, 8986230, 4917240, -14538862, -61860772, -145127602, -248063392, -292843734, -90180988, 692992166, 2468418888, 5415220546, 8722746156, 9258303102
Offset: 0

Views

Author

Paul Barry, Apr 25 2005

Keywords

Comments

Real part is A106201.
For n>=2, a(n) equals -1 times the imaginary part of the determinant of the (n-1) X (n-1) matrix with i's along the superdiagonal (i is the imaginary unit), 2's along the subdiagonal, 1's along the main diagonal, and 0's everywhere else (see Mathematica code below). - John M. Campbell, Jun 04 2011

Crossrefs

Programs

  • Mathematica
    Table[-Im[Det[Array[KroneckerDelta[#1 + 1, #2]*I &, {n - 1, n - 1}] + Array[KroneckerDelta[#1 - 1, #2]*2 &, {n - 1, n - 1}] + IdentityMatrix[n - 1]]], {n, 2, 40}] (* John M. Campbell, Jun 04 2011 *)
  • PARI
    concat(vector(3), Vec(2*x^3/(1-2*x+x^2+4*x^4) + O(x^50))) \\ Michel Marcus, Jan 03 2016

Formula

G.f.: 2*x^3/(1-2*x+x^2+4*x^4).
a(n) = Sum_{k=0..floor((n-1)/2)} binomial(n-k-1, k)*2^k*sin(Pi*k/2).

A141665 A signed half of Pascal's triangle A007318: p(x,n) = (1+I*x)^n; t(n,m) = real part of coefficients(p(x,n)).

Original entry on oeis.org

1, 1, 0, 1, 0, -1, 1, 0, -3, 0, 1, 0, -6, 0, 1, 1, 0, -10, 0, 5, 0, 1, 0, -15, 0, 15, 0, -1, 1, 0, -21, 0, 35, 0, -7, 0, 1, 0, -28, 0, 70, 0, -28, 0, 1, 1, 0, -36, 0, 126, 0, -84, 0, 9, 0, 1, 0, -45, 0, 210, 0, -210, 0, 45, 0, -1
Offset: 0

Views

Author

Roger L. Bagula and Gary W. Adamson, Sep 05 2008

Keywords

Comments

Polynomials like these are seen in complex dynamics.
This method symmetrically breaks up Pascal's triangle A007318 into two parts as polynomial coefficient vectors. See the examples for the s(n,m) = imaginary part of coefficients(p(x,n)).
From Johannes W. Meijer, Mar 10 2012: (Start)
The row sums equal A146559 and the two antidiagonal sums lead to A104862 (minus a(0)) and A110161 (minus a(0)).
The mirror of this triangle (for the absolute values of the coefficients) is A119467. (End)

Examples

			s(n,m) = imaginary part of coefficients(p(x,n))
  {0},
  {0,   1},
  {0,   2,   0},
  {0,   3,   0,   -1},
  {0,   4,   0,   -4,   0},
  {0,   5,   0,  -10,   0,   1},
  {0,   6,   0,  -20,   0,   6,   0},
  {0,   7,   0,  -35,   0,  21,   0,   -1},
  {0,   8,   0,  -56,   0,  56,   0,   -8,   0},
  {0,   9,   0,  -84,   0, 126,   0,  -36,   0,   1},
  {0,  10,   0, -120,   0, 252,   0, -120,   0,  10,   0}
		

Crossrefs

Programs

  • Maple
    From Johannes W. Meijer, Mar 10 2012: (Start)
    nmax:=10: for n from 0 to nmax do p(x,n) := (1+I*x)^n: for m from 0 to n do t(n,m) := Re(coeff(p(x,n), x, m)) od: od: seq(seq(t(n,m), m=0..n), n=0..nmax);
    nmax:=10: for n from 0 to nmax do for m from 0 to n do A119467(n,m) := binomial(n,m) * (1+(-1)^(n-m))/2: if (m mod 4 = 2) then x(n,m):= -1 else x(n,m):= 1 end if: od: od: for n from 0 to nmax do for m from 0 to n do t(n,m) := A119467(n,n-m)*x(n,m) od: od: seq(seq(t(n,m), m=0..n), n=0..nmax); # (End)
  • Mathematica
    p[x_, n_] := If[n == 0, 1, Product[(1 + I*x), {i, 1, n}]]; Table[Expand[p[x, n]], {n, 0, 10}]; Table[Im[CoefficientList[p[x, n], x]], {n, 0, 10}]; Flatten[%] Table[Re[CoefficientList[p[x, n], x]], {n, 0, 10}]; Flatten[%]

Formula

p(x,n) = (1+I*x)^n
t(n,m) = real part of coefficients(p(x,n))
s(n,m) = imaginary part of coefficients(p(x,n))

Extensions

Edited and information added by Johannes W. Meijer, Mar 10 2012
Previous Showing 11-12 of 12 results.