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.

A173197 a(0)=1, a(n)= 2+2^n/6+4*(-1)^n/3, n>0.

Original entry on oeis.org

1, 1, 4, 2, 6, 6, 14, 22, 46, 86, 174, 342, 686, 1366, 2734, 5462, 10926, 21846, 43694, 87382, 174766, 349526, 699054, 1398102, 2796206, 5592406, 11184814, 22369622, 44739246, 89478486, 178956974, 357913942, 715827886, 1431655766, 2863311534, 5726623062, 11453246126, 22906492246, 45812984494, 91625968982, 183251937966, 366503875926, 733007751854
Offset: 0

Views

Author

Paul Curtz, Feb 12 2010

Keywords

Comments

Linked to Jacobsthal numbers (expansion of tan(x), a.k.a. Zag numbers) A000182=1,2,16,272,...: a(n+1)-2a(n) = -(-1)^n*(A000182(n) mod 10) = (-1,2,-6,2,-6,2,-6,...).
Cf. A173114, related to Euler (or secant, or Zig) numbers, A000364. a(n+1)+A010684=A001045.
First differences: 0,3,-2,4,0,8,8,24,... = 0,A154879 (third differences of A001045).
Main diagonal: A003945; first upper diagonal: -A171449; second: 4*A011782.

Formula

a(n) = A093380(n+4), n>3.
a(n) = +2*a(n-1) +a(n-2) -2*a(n-3), n>3.
G.f.: 1-x*(-1-2*x+7*x^2)/((x-1)*(2*x-1)*(1+x)).
a(2n+2)+a(2n+3)=6*A047689.
a(2n)-a(2n-2) = 3,1,2,4,8,16,... = 3,A000079.

A173261 Array T(n,k) read by antidiagonals: T(n,2k)=1, T(n,2k+1)=n, n>=2, k>=0.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 1, 4, 1, 2, 1, 5, 1, 3, 1, 1, 6, 1, 4, 1, 2, 1, 7, 1, 5, 1, 3, 1, 1, 8, 1, 6, 1, 4, 1, 2, 1, 9, 1, 7, 1, 5, 1, 3, 1, 1, 10, 1, 8, 1, 6, 1, 4, 1, 2, 1, 11, 1, 9, 1, 7, 1, 5, 1, 3, 1, 1, 12, 1, 10, 1, 8, 1, 6, 1, 4, 1, 2, 1, 13, 1, 11, 1, 9, 1, 7, 1, 5, 1, 3, 1, 1, 14, 1, 12, 1, 10, 1, 8, 1, 6, 1, 4, 1, 2
Offset: 2

Views

Author

Paul Curtz, Feb 14 2010

Keywords

Comments

One may define another array B(n,0) = -1, B(n,k) = T(n,k-1) + 2*B(n,k-1), n>=2, which also starts in columns k>=0, as follows:
-1, -1, 0, 1, 4, 9, 20, 41, 84, 169, 340, 681, 1364 ...: A084639;
-1, -1, 1, 3, 9, 19, 41, 83, 169, 339, 681, 1363, 2729;
-1, -1, 2, 5, 14, 29, 62, 125, 254, 509, 1022, 2045, 4094;
-1, -1, 3, 7, 19, 39, 83, 167, 339, 679, 1363, 2727, 5459 ...: -A173114;
B(n,k) = (n-1)*A001045(k) - T(n,k).
First differences are B(n,k+1) - B(n,k) = (n-1)*A001045(k).

Examples

			The array T(n,k) starts in row n=2 with columns k>=0 as:
  1,  2, 1,  2, 1,  2, 1,  2, 1,  2, 1,  2 ... A000034;
  1,  3, 1,  3, 1,  3, 1,  3, 1,  3, 1,  3 ... A010684;
  1,  4, 1,  4, 1,  4, 1,  4, 1,  4, 1,  4 ... A010685;
  1,  5, 1,  5, 1,  5, 1,  5, 1,  5, 1,  5 ... A010686;
  1,  6, 1,  6, 1,  6, 1,  6, 1,  6, 1,  6 ... A010687;
  1,  7, 1,  7, 1,  7, 1,  7, 1,  7, 1,  7 ... A010688;
  1,  8, 1,  8, 1,  8, 1,  8, 1,  8, 1,  8 ... A010689;
  1,  9, 1,  9, 1,  9, 1,  9, 1,  9, 1,  9 ... A010690;
  1, 10, 1, 10, 1, 10, 1, 10, 1, 10, 1, 10 ... A010691.
Antidiagonal triangle begins as:
  1;
  1,  2;
  1,  3,  1;
  1,  4,  1,  2;
  1,  5,  1,  3,  1;
  1,  6,  1,  4,  1,  2;
  1,  7,  1,  5,  1,  3,  1;
  1,  8,  1,  6,  1,  4,  1,  2;
  1,  9,  1,  7,  1,  5,  1,  3,  1;
  1, 10,  1,  8,  1,  6,  1,  4,  1,  2;
  1, 11,  1,  9,  1,  7,  1,  5,  1,  3,  1;
  1, 12,  1, 10,  1,  8,  1,  6,  1,  4,  1,  2;
  1, 13,  1, 11,  1,  9,  1,  7,  1,  5,  1,  3,  1;
  1, 14,  1, 12,  1, 10,  1,  8,  1,  6,  1,  4,  1,  2;
		

Crossrefs

Programs

  • Mathematica
    T[n_, k_]:= (1/2)*((n+3) - (n+1)*(-1)^k);
    Table[T[n-k, k], {n,2,17}, {k,2,n}]//Flatten (* G. C. Greubel, Dec 03 2021 *)
  • Sage
    flatten([[(1/2)*((n-k+3) - (n-k+1)*(-1)^k) for k in (2..n)] for n in (2..17)]) # G. C. Greubel, Dec 03 2021

Formula

From G. C. Greubel, Dec 03 2021: (Start)
T(n, k) = (1/2)*((n+3) - (n+1)*(-1)^k).
Sum_{k=0..n} T(n-k, k) = A024206(n).
Sum_{k=0..floor((n+2)/2)} T(n-2*k+2, k) = (1/16)*(2*n^2 4*n -5*(1 +(-1)^n) + 4*sin(n*Pi/2)) (diagonal sums).
T(2*n-2, n) = A093178(n). (End)
Showing 1-2 of 2 results.