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.

A238801 Triangle T(n,k), read by rows, given by T(n,k) = C(n+1, k+1)*(1-(k mod 2)).

Original entry on oeis.org

1, 2, 0, 3, 0, 1, 4, 0, 4, 0, 5, 0, 10, 0, 1, 6, 0, 20, 0, 6, 0, 7, 0, 35, 0, 21, 0, 1, 8, 0, 56, 0, 56, 0, 8, 0, 9, 0, 84, 0, 126, 0, 36, 0, 1, 10, 0, 120, 0, 252, 0, 120, 0, 10, 0, 11, 0, 165, 0, 462, 0, 330, 0, 55, 0, 1, 12, 0, 220, 0, 792, 0, 792, 0, 220, 0, 12, 0
Offset: 0

Views

Author

Philippe Deléham, Mar 05 2014

Keywords

Comments

Row sums are powers of 2.

Examples

			Triangle begins:
1;
2, 0;
3, 0, 1;
4, 0, 4, 0;
5, 0, 10, 0, 1;
6, 0, 20, 0, 6, 0;
7, 0, 35, 0, 21, 0, 1;
8, 0, 56, 0, 56, 0, 8, 0;
9, 0, 84, 0, 126, 0, 36, 0, 1;
10, 0, 120, 0, 252, 0, 120, 0, 10, 0; etc.
		

Crossrefs

Programs

  • Mathematica
    Table[Binomial[n + 1, k + 1]*(1 - Mod[k , 2]), {n, 0, 10}, {k, 0, n}] // Flatten (* G. C. Greubel, Nov 22 2017 *)
  • PARI
    T(n,k) = binomial(n+1, k+1)*(1-(k % 2));
    tabl(nn) = for (n=0, nn, for (k=0, n, print1(T(n,k), ", ")); print); \\ Michel Marcus, Nov 23 2017

Formula

G.f.: 1/((1+(y-1)*x)*(1-(y+1)*x)).
T(n,k) = 2*T(n-1,k) + T(n-2,k-2) - T(n-2,k), T(0,0) = 1, T(1,0) = 2, T(1,1) = 0, T(n,k) = 0 if k<0 or if k>n.
Sum_{k=0..n} T(n,k)*x^k = A000027(n+1), A000079(n), A015518(n+1), A003683(n+1), A079773(n+1), A051958(n+1), A080920(n+1), A053455(n), A160958(n+1) for x = 0, 1, 2, 3, 4, 5, 6, 7, 8 respectively.

A080921 a(n) = 2*a(n-1) + 48*a(n-2), a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 2, 52, 200, 2896, 15392, 169792, 1078400, 10306816, 72376832, 639480832, 4753049600, 40201179136, 308548739072, 2546754076672, 19903847628800, 162051890937856, 1279488468058112, 10337467701133312, 82090381869056000
Offset: 0

Views

Author

Paul Barry, Feb 24 2003

Keywords

Comments

Essentially the same as A053455: a(n) = A053455(n-1), n>=1.

Crossrefs

Programs

  • Mathematica
    CoefficientList[Series[x / ((1 + 6 x) (1 - 8 x)), {x, 0, 20}], x] (* Vincenzo Librandi, Aug 05 2013 *)
    LinearRecurrence[{2,48},{0,1},30] (* Harvey P. Dale, Jan 20 2016 *)

Formula

a(n) = (8^n - (-6)^n)/14.
a(n) = Sum{k=1..n, binomial(n, 2k-1) * 7^(2(k-1)) }
G.f.: x/((1+6*x)*(1-8*x)).
a(n) = A053455(n-1), n>=1. [R. J. Mathar, Sep 18 2008]
Showing 1-2 of 2 results.