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 41-43 of 43 results.

A334824 Triangle, read by rows, of Lambert's numerator polynomials related to convergents of tan(x).

Original entry on oeis.org

1, 3, 0, 15, 0, -1, 105, 0, -10, 0, 945, 0, -105, 0, 1, 10395, 0, -1260, 0, 21, 0, 135135, 0, -17325, 0, 378, 0, -1, 2027025, 0, -270270, 0, 6930, 0, -36, 0, 34459425, 0, -4729725, 0, 135135, 0, -990, 0, 1, 654729075, 0, -91891800, 0, 2837835, 0, -25740, 0, 55, 0, 13749310575, 0, -1964187225, 0, 64324260, 0, -675675, 0, 2145, 0, -1
Offset: 0

Views

Author

G. C. Greubel, May 13 2020, following a suggestion from Michel Marcus

Keywords

Comments

Lambert's denominator polynomials related to convergents of tan(x), f(n, x), are given in A334823.

Examples

			Polynomials:
g(0, x) = 1;
g(1, x) = 3*x;
g(2, x) = 15*x^2 - 1;
g(3, x) = 105*x^3 - 10*x;
g(4, x) = 945*x^4 - 105*x^2 + 1;
g(5, x) = 10395*x^5 - 1260*x^3 + 21*x;
g(6, x) = 135135*x^6 - 17325*x^4 + 378*x^2 - 1;
g(7, x) = 2027025*x^7 - 270270*x^5 + 6930*x^3 - 36*x.
Triangle of coefficients begins as:
        1;
        3, 0;
       15, 0,      -1;
      105, 0,     -10, 0;
      945, 0,    -105, 0,    1;
    10395, 0,   -1260, 0,   21, 0;
   135135, 0,  -17325, 0,  378, 0,  -1;
  2027025, 0, -270270, 0, 6930, 0, -36, 0.
		

Crossrefs

Columns k: A001147 (k=0), A000457 (k=2), A001881 (k=4), A130563 (k=6).

Programs

  • Magma
    C := ComplexField();
    T:= func< n, k| Round( i^k*Factorial(2*n-k+1)*(1+(-1)^k)/(2^(n-k+1)*Factorial(k+1)*Factorial(n-k)) ) >;
    [T(n,k): k in [0..n], n in [0..10]];
    
  • Maple
    T:= (n, k) -> I^k*(2*n-k+1)!*(1+(-1)^k)/(2^(n-k+1)*(k+1)!*(n-k)!);
    seq(seq(T(n, k), k = 0..n), n = 0..10);
  • Mathematica
    (* First program *)
    y[n_, x_]:= Sqrt[2/(Pi*x)]*E^(1/x)*BesselK[-n -1/2, 1/x];
    g[n_, k_]:= Coefficient[((-I)^n/2)*(y[n+1, I*x] + (-1)^n*y[n+1, -I*x]), x, k];
    Table[g[n, k], {n,0,10}, {k,n,0,-1}]//Flatten
    (* Second program *)
    Table[I^k*(2*n-k+1)!*(1+(-1)^k)/(2^(n-k+1)*(k+1)!*(n-k)!), {n,0,10}, {k,0,n}]//Flatten
  • Sage
    [[ i^k*factorial(2*n-k+1)*(1+(-1)^k)/(2^(n-k+1)*factorial(k+1)*factorial(n-k)) for k in (0..n)] for n in (0..10)]

Formula

Equals the coefficients of the polynomials, g(n, x), defined by: (Start)
g(n, x) = Sum_{k=0..floor(n/2)} ((-1)^k*(2*n-2*k+1)!/((2*k+1)!*(n-2*k)!))*(x/2)^(n-2*k).
g(n, x) = ((2*n+1)!/n!)*(x/2)^n*Hypergeometric2F3(-n/2, (1-n)/2; 3/2, -n, -n-1/2; -1/x^2).
g(n, x) = ((-i)^n/2)*(y(n+1, i*x) + (-1)^n*y(n+1, -i*x)), where y(n, x) are the Bessel Polynomials.
g(n, x) = (2*n-1)*x*g(n-1, x) - g(n-2, x).
E.g.f. of g(n, x): sin((1 - sqrt(1-2*x*t))/2)/sqrt(1-2*x*t).
g(n, 1) = (-1)^n*g(n, -1) = A053984(n) = (-1)^n*A053983(-n-1) = (-1)^n*f(-n-1, 1).
g(n, 2) = (-1)^n*g(n, -2) = A053987(n+1). (End)
As a number triangle:
T(n, k) = i^k*(2*n-k+1)!*(1+(-1)^k)/(2^(n-k+1)*(k+1)!*(n-k)!), where i = sqrt(-1).
T(n, 0) = A001147(n+1).

A065943 Triangle of coefficients of Bessel polynomials {y_n(x)}''.

Original entry on oeis.org

3, 6, 30, 10, 90, 315, 15, 210, 1260, 3780, 21, 420, 3780, 18900, 51975, 28, 756, 9450, 69300, 311850, 810810, 36, 1260, 20790, 207900, 1351350, 5675670, 14189175, 45, 1980, 41580, 540540, 4729725, 28378350, 113513400, 275675400
Offset: 2

Author

N. J. A. Sloane, Dec 08 2001

Keywords

Examples

			For n = 2 .. 5 the polynomials are 6; 30+90*x; 90+630*x+1260*x^2; 210+2520*x+11340*x^2+18900*x^3.
		

References

  • J. Riordan, Combinatorial Identities, Wiley, 1968, p. 77.

Crossrefs

A305402 A number triangle T(n,k) read by rows for 0<=k<=n, related to the Taylor expansion of f(u, p) = (1/2)*(1+1/(sqrt(1-u^2)))*exp(p*sqrt(1-u^2)).

Original entry on oeis.org

1, 1, -2, 3, -4, 2, 15, -18, 9, -2, 105, -120, 60, -16, 2, 945, -1050, 525, -150, 25, -2, 10395, -11340, 5670, -1680, 315, -36, 2, 135135, -145530, 72765, -22050, 4410, -588, 49, -2, 2027025, -2162160, 1081080, -332640, 69300, -10080, 1008, -64, 2
Offset: 0

Author

Johannes W. Meijer, May 31 2018

Keywords

Comments

The function f(u, p) = (1/2)*(1+1/(sqrt(1-u^2))) * exp(p*sqrt(1-u^2)) was found while studying the Fresnel-Kirchhoff and the Rayleigh-Sommerfeld theories of diffraction, see the Meijer link.
The Taylor expansion of f(u, p) leads to the number triangle T(n, k), see the example section.
Normalization of the triangle terms, dividing the T(n, k) by T(n-k, 0), leads to A084534.
The row sums equal A003436, n >= 2, respectively A231622, n >= 1.

Examples

			The first few terms of the Taylor expansion of f(u; p) are:
f(u, p) = exp(p) * (1 + (1-2*p) * u^2/4 + (3-4*p+2*p^2) * u^4/16 + (15-18*p+9*p^2-2*p^3) * u^6/96 + (105-120*p+60*p^2-16*p^3+2*p^4) * u^8/768 + ... )
The first few rows of the T(n, k) triangle are:
n=0:     1
n=1:     1,     -2
n=2:     3,     -4,    2
n=3:    15,    -18,    9,    -2
n=4:   105,   -120,   60,   -16,   2
n=5:   945,  -1050,  525,  -150,  25,  -2
n=6: 10395, -11340, 5670, -1680, 315, -36, 2
		

References

  • J. W. Goodman, Introduction to Fourier Optics, 1996.
  • A. Papoulis, Systems and Transforms with Applications in Optics, 1968.

Crossrefs

Cf. Related to the left hand columns: A001147, A001193, A261065.
Cf. Related to the right hand columns: A280560, A162395, A006011, A040977, A053347, A054334, A266561.

Programs

  • Magma
    [[n le 0 select 1 else (-1)^k*2^(k-n+1)*Factorial(2*n-k-1)*Binomial(n, k)/Factorial(n-1): k in [0..n]]: n in [1..10]]; // G. C. Greubel, Nov 08 2018
  • Maple
    T := proc(n, k): if n=0 then 1 else (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!) fi: end: seq(seq(T(n, k), k=0..n), n=0..8);
  • Mathematica
    Table[If[n==0 && k==0,1, (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!)], {n, 0, 10}, {k,0,n}]//Flatten (* G. C. Greubel, Nov 08 2018 *)
  • PARI
    T(n,k) = {if(n==0, 1, (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!))}
    for(n=0, 10, for(k=0, n, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 08 2018
    

Formula

T(n, k) = (-1)^k*2^(k-n+1)*n*(2*n-k-1)!/(k!*(n-k)!), n > 0 and 0 <= k <= n, T(0, 0) = 1.
T(n, k) = (-1)^k*A001147(n-k)*A084534(n, k), n >= 0 and 0 <= k <= n.
T(n, k) = 2^(2*(k-n)+1)*A001147(n-k)*A127674(n, n-k), n > 0 and 0 <= k <= n, T(0, 0) = 1.
T(n, k) = (-1)^k*(A001497(n, k) + A132062(n, k)), n >= 1, T(0,0) = 1.
Previous Showing 41-43 of 43 results.