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.

A131779 Triangle read by rows: T(n,k) = 2*A065941(n-1,k-1) - (-1)^(n+k).

Original entry on oeis.org

1, 3, 1, 1, 3, 1, 3, 1, 5, 1, 1, 3, 5, 5, 1, 3, 1, 9, 5, 7, 1, 1, 3, 9, 9, 11, 7, 1, 3, 1, 13, 9, 21, 11, 9, 1, 1, 3, 13, 13, 29, 21, 19, 9, 1, 3, 1, 17, 13, 43, 29, 41, 19, 11, 1, 1, 3, 17, 17, 55, 43, 69, 41, 29, 11, 1, 3, 1, 21, 17, 73, 55, 113, 69, 71, 29, 13, 1
Offset: 1

Views

Author

Gary W. Adamson, Jul 14 2007

Keywords

Examples

			First few rows of the triangle are:
  1;
  3, 1;
  1, 3, 1;
  3, 1, 5, 1;
  1, 3, 5, 5, 1;
  3, 1, 9, 5, 7, 1;
  1, 3, 9, 9, 11, 7, 1;
  ...
		

Crossrefs

Row sums are A131780.
Cf. A065941.

Programs

  • PARI
    T(n,k) = {if(k<=n, 2*binomial(n-1-k\2, (k-1)\2) - (-1)^(n+k), 0)} \\ Andrew Howroyd, Sep 08 2018

Formula

T(n,k) = 2*binomial(n-1-floor(k/2), floor((k-1)/2)) - (-1)^(n+k). - Andrew Howroyd, Sep 08 2018

Extensions

a(28)-a(29) corrected and terms a(56) and beyond from Andrew Howroyd, Sep 08 2018