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.

Showing 1-2 of 2 results.

A128018 Expansion of (1-4*x)/(1-2*x+4*x^2).

Original entry on oeis.org

1, -2, -8, -8, 16, 64, 64, -128, -512, -512, 1024, 4096, 4096, -8192, -32768, -32768, 65536, 262144, 262144, -524288, -2097152, -2097152, 4194304, 16777216, 16777216, -33554432, -134217728, -134217728, 268435456, 1073741824, 1073741824, -2147483648, -8589934592
Offset: 0

Views

Author

Paul Barry, Feb 11 2007

Keywords

Comments

Hankel transform of A128014(n+1). Binomial transform of A128019.
Hankel transform of A002426(n+1). - Paul Barry, Mar 15 2008
Hankel transform of A007971(n+1). - Paul Barry, Sep 30 2009
Hankel transform of A103970 is a(n)/4^C(n+1,2). - Paul Barry, Nov 20 2009
The real part of Q^(n+1), where Q is the quaternion 1+i+j+k. - Stanislav Sykora, Jun 11 2012.

Crossrefs

Programs

  • Mathematica
    CoefficientList[Series[(1 - 4*x)/(1 - 2*x + 4*x^2), {x,0,50}], x] (* or *) LinearRecurrence[{2,-4},{1,-2},50] (* G. C. Greubel, Feb 28 2017 *)
  • PARI
    x='x+O('x^50); Vec((1-4*x)/(1-2*x+4*x^2)) \\ G. C. Greubel, Feb 28 2017

Formula

a(n) = A138340(n)/2^n. - Philippe Deléham, Nov 14 2008
a(n) = 2^(n+1)*cos(Pi*(n+1)/3). - Richard Choulet, Nov 19 2008
From Paul Barry, Oct 21 2009: (Start)
a(n) = Sum_{k=0..floor((n+1)/2)} C(n+1,2*k)*(-3)^k.
a(n) = ((1+i*sqrt(3))^(n+1) + (1-i*sqrt(3))^(n+1))/2, i=sqrt(-1). (End)
G.f.: G(0)/(2*x)-1/x, where G(k)= 1 + 1/(1 - x*(3*k+1)/(x*(3*k+4) + 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 27 2013
a(n) = 2^n*A057079(n+2). - R. J. Mathar, Mar 04 2018
Sum_{n>=0} 1/a(n) = 1/3. - Amiram Eldar, Feb 14 2023

A121314 Triangle T(n,k), 0 <= k <= n, read by rows given by [0, 1, 0, 0, 0, 0, ...] DELTA [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 5, 6, 1, 0, 1, 7, 15, 10, 1, 0, 1, 9, 28, 35, 15, 1, 0, 1, 11, 45, 84, 70, 21, 1, 0, 1, 13, 66, 165, 210, 126, 28, 1, 0, 1, 15, 91, 286, 495, 462, 210, 36, 1
Offset: 0

Views

Author

Philippe Deléham, Aug 25 2006

Keywords

Comments

A054142 with first diagonal 1, 0, 0, 0, 0, 0, 0, 0, ...
Mirror image of triangle in A165253.

Examples

			Triangle begins
  1;
  0,  1;
  0,  1,  1;
  0,  1,  3,  1;
  0,  1,  5,  6,  1;
  0,  1,  7, 15, 10,  1;
  0,  1,  9, 28, 35, 15,  1;
  0,  1, 11, 45, 84, 70, 21,  1;
		

Crossrefs

Formula

T(0,0)=1; T(n,0)=0 for n > 0; T(n+1,k+1) = binomial(2*n-k,k)for n >= 0 and k >= 0.
Sum_{k=0..n} T(n,k)*x^k = A001519(n), A047849(n), A165310(n), A165311(n), A165312(n), A165314(n), A165322(n), A165323(n), A165324(n) for x = 1,2,3,4,5,6,7,8,9 respectively.
Sum_{k=0..n} 2^k*T(n,k) = (4^n+2)/3.
Sum_{k=0..n} 2^(n-k)*T(n,k) = A001835(n).
Sum_{k=0..n} 3^k*4^(n-k)*T(n,k) = A054879(n). - Philippe Deléham, Aug 26 2006
Sum_{k=0..n} T(n,k)*(-1)^k*2^(3n-2k) = A143126(n). - Philippe Deléham, Oct 31 2008
Sum_{k=0..n} T(n,k)*(-1)^k*3^(n-k) = A138340(n)/4^n. - Philippe Deléham, Nov 01 2008
G.f.: (1-(y+1)*x)/(1-(2y+1)*x+y^2*x^2). - Philippe Deléham, Nov 01 2011
T(n,k) = T(n-1,k) + 2*T(n-1,k-1) - T(n-2,k-2), T(0,0) = T(1,1) = 1, T(1,0) = 0. - Philippe Deléham, Feb 19 2012
Showing 1-2 of 2 results.