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.

A144400 Triangle read by rows: row n (n > 0) gives the coefficients of x^k (0 <= k <= n - 1) in the expansion of Sum_{j=0..n} A000931(j+4)*binomial(n, j)*x^(j - 1)*(1 - x)^(n - j).

Original entry on oeis.org

1, 2, -1, 3, -3, 1, 4, -6, 4, 0, 5, -10, 10, 0, -3, 6, -15, 20, 0, -18, 10, 7, -21, 35, 0, -63, 70, -24, 8, -28, 56, 0, -168, 280, -192, 49, 9, -36, 84, 0, -378, 840, -864, 441, -89, 10, -45, 120, 0, -756, 2100, -2880, 2205, -890, 145, 11, -55, 165, 0
Offset: 1

Views

Author

Roger L. Bagula and Gary W. Adamson, Oct 03 2008

Keywords

Examples

			Triangle begins:
    1;
    2,  -1;
    3,  -3,   1;
    4,  -6,   4, 0;
    5, -10,  10, 0,   -3;
    6, -15,  20, 0,  -18,   10;
    7, -21,  35, 0,  -63,   70,   -24;
    8, -28,  56, 0, -168,  280,  -192,   49;
    9, -36,  84, 0, -378,  840,  -864,  441,  -89;
   10, -45, 120, 0, -756, 2100, -2880, 2205, -890, 145;
     ... reformatted. - _Franck Maminirina Ramaharo_, Oct 22 2018
		

Crossrefs

Programs

  • Mathematica
    a[n_]:= a[n]= If[n<3, Fibonacci[n], a[n-2] + a[n-3]];
    p[x_, n_]:= Sum[a[k]*Binomial[n, k]*x^(k-1)*(1-x)^(n-k), {k, 0, n}];
    Table[Coefficient[p[x, n], x, k], {n, 12}, {k, 0, n-1}]//Flatten
  • Sage
    @CachedFunction
    def f(n): return fibonacci(n) if (n<3) else f(n-2) + f(n-3)
    def p(n,x): return sum( binomial(n,j)*f(j)*x^(j-1)*(1-x)^(n-j) for j in (0..n) )
    def T(n): return ( p(n,x) ).full_simplify().coefficients(sparse=False)
    [T(n) for n in (1..12)] # G. C. Greubel, Jul 14 2021

Formula

G.f.: (y - (1 - 2*x)*y^2)/(1 - 3*(1 - x)*y + (3 - 6*x + 2*x^2)*y^2 - (1 - 3*x + 2*x^2 + x^3)*y^3). - Franck Maminirina Ramaharo, Oct 22 2018

Extensions

Edited, and new name by Franck Maminirina Ramaharo, Oct 22 2018

A141683 a(n) = Sum_{k=1..n} b(k)*a(n - k) for n >= 1, where b(n) = b(n-2) + b(n-3) for n >= 3 with b(0) = 0 and b(1) = b(2) = 1.

Original entry on oeis.org

1, 1, 2, 4, 9, 19, 41, 88, 189, 406, 872, 1873, 4023, 8641, 18560, 39865, 85626, 183916, 395033, 848491, 1822473, 3914488, 8407925, 18059374, 38789712, 83316385, 178955183, 384377665, 825604416, 1773314929, 3808901426
Offset: 1

Views

Author

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

Keywords

Comments

Essentially the same as A141015. - R. J. Mathar, Sep 14 2008

Crossrefs

Programs

  • Magma
    m:=35; R:=PowerSeriesRing(Integers(), m); Coefficients(R!(x*(1-x^2-x^3)/(1-x-2*x^2-x^3))); // G. C. Greubel, Jun 05 2018
  • Mathematica
    (* b = A000931 *)
    b[0]=0; b[1]=1; b[2]=1; b[n_]:= b[n]= b[n-2] + b[n-3];
    a[1]=1; a[n_]:= a[n]= Sum[b[k]*a[n-k], {k,n-1}];
    Table[a[n], {n, 35}]
    (* or *)
    LinearRecurrence[{1, 2, 1}, {1, 1, 2, 4}, 31] (* Georg Fischer, Mar 23 2019 *)
  • PARI
    x='x+O('x^35); Vec(x*(1-x^2-x^3)/(1-x-2*x^2-x^3)) \\ G. C. Greubel, Jun 05 2018
    

Formula

a(n) = Sum_{k=1..n} b(k)*a(n - k) for n >= 1, where b(n) = b(n-2) + b(n-3) for n >= 3 with b(0) = 0 and b(1) = b(2) = 1. [That is, b(n) = A000931(n+4) = A078027(n+6) = A134816(n) = A182097(n+1). - Petros Hadjicostas, Aug 09 2020]
From Colin Barker, Feb 01 2012: (Start)
a(n) = a(n-1) + 2*a(n-2) + a(n-3), n > 4.
G.f.: x*(1 - x^2 - x^3)/(1 - x - 2*x^2 - x^3). (End)
a(n) = A000930(2*n - 3) for n >= 3. - Georg Fischer, Mar 23 2019
Previous Showing 11-12 of 12 results.