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.

A167613 Array T(n,k) read by antidiagonals: the k-th term of the n-th difference of A131531.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 0, -1, -2, -3, 0, 0, 1, 3, 6, -1, -1, -1, -2, -5, -11, 0, 1, 2, 3, 5, 10, 21, 0, 0, -1, -3, -6, -11, -21, -42, 1, 1, 1, 2, 5, 11, 22, 43, 85, 0, -1, -2, -3, -5, -10, -21, -43, -86, -171, 0, 0, 1, 3, 6, 11, 21, 42, 85, 171, 342, -1, -1, -1, -2, -5, -11, -22, -43, -85, -170, -341, -683, 0, 1, 2, 3, 5, 10, 21, 43, 86, 171, 341, 682, 1365
Offset: 0

Views

Author

Paul Curtz, Nov 07 2009

Keywords

Comments

The array contains A131708(0) in diagonal 0, then -A024495(0..1) in diagonal 1, then A024493(0..2) in diagonal 2, then -A131708(0..3), then A024495(0..4), then -A024493(0..5).

Examples

			The table starts in row n=0 with columns k >= 0 as:
0, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0 A131531
0, 1, -1, 0, -1, 1, 0, 1, -1, 0, -1, 1, 0, 1, -1, 0, -1, 1, 0, 1, -1 A092220
1, -2, 1, -1, 2, -1, 1, -2, 1, -1, 2, -1, 1, -2, 1, -1, 2, -1, 1, -2 A131556
-3, 3, -2, 3, -3, 2, -3, 3, -2, 3, -3, 2, -3, 3, -2, 3, -3, 2, -3 A164359
6, -5, 5, -6, 5, -5, 6, -5, 5, -6, 5, -5, 6, -5, 5, -6, 5, -5, 6, -5
-11, 10, -11, 11, -10, 11, -11, 10, -11, 11, -10, 11, -11, 10, -11
21, -21, 22, -21, 21, -22, 21, -21, 22, -21, 21, -22, 21, -21, 22
		

Crossrefs

Cf. A167617 (antidiagonal sums).

Programs

  • Maple
    A131531 := proc(n) op((n mod 6)+1,[0,0,1,0,0,-1]) ; end proc:
    A167613 := proc(n,k) option remember; if n= 0 then A131531(k); else procname(n-1,k+1)-procname(n-1,k) ; end if;end proc: # R. J. Mathar, Dec 17 2010
  • Mathematica
    nmax = 13;
    A131531 = Table[{0, 0, 1, 0, 0, -1}, {nmax}] // Flatten;
    T[n_] := T[n] = Differences[A131531, n];
    T[n_, k_] := T[n][[k]];
    Table[T[n-k, k], {n, 1, nmax}, {k, n, 1, -1}] // Flatten (* Jean-François Alcover, Oct 20 2023 *)

Formula

T(0,k) = A131531(k). T(n,k) = T(n-1,k+1) - T(n-1,k), n > 0.
T(n,n) = A001045(n). T(n,n+1) = -A001045(n). T(n,n+2) = A078008(n).
T(n,0) = -T(n,3) = (-1)^(n+1)*A024495(n).
T(n,1) = (-1)^(n+1)*A131708(n).
T(n,2) = (-1)^n*A024493(n).
T(n,k+6) = T(n,k).
a(n) = A131708(0), -A024495(0,1), A024493(0,1,2), -A131708(0,1,2,3), A024495(0,1,2,3,4), -A024493(0,1,2,3,4,5).