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 51-52 of 52 results.

A330885 Square array T(n,k) read by antidiagonals upwards: T(n,0)=1; T(n,1) = n+1; T(n,2) = 2n+1, T(n,k>2) = T(n,k-1) - T(n,k-2) - T(n,k-3).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, -1, 1, 4, 5, 0, -3, 1, 5, 7, 1, -5, -3, 1, 6, 9, 2, -7, -8, 1, 1, 7, 11, 3, -9, -13, -3, 7, 1, 8, 13, 4, -11, -18, -7, 10, 9, 1, 9, 15, 5, -13, -23, -11, 13, 21, 1, 1, 10, 17, 6, -15, -28, -15, 16, 33, 14, -15
Offset: 0

Views

Author

Bob Selcoe, May 05 2020

Keywords

Examples

			Array starts:
1  1   1  -1   -3   -3    1   7   9   1  -15   -25
1  2   3   0   -5   -8   -3  10  21  14  -17   -52
1  3   5   1   -7  -13   -7  13  33  27  -19   -79
1  4   7   2   -9  -18  -11  16  45  40  -21  -106
1  5   9   3  -11  -23  -15  19  57  53  -23  -133
1  6  11   4  -13  -28  -19  22  69  66  -25  -160
1  7  13   5  -15  -33  -23  25  81  79  -27  -187
		

Crossrefs

Columns k: A000012 (k=0), A000027 (k=1), A005408 (k=2), A023443 (k=3), A165747 (k=4), -A016885 (k=5), -A004767 (k=6), A016777 (k=7), A017629 (k=8), A190991 (k=9).

Programs

  • Mathematica
    T[n_, k_]:= T[n, k]= If[k<3, k*n+1, T[n, k-1] - T[n, k-2] - T[n, k-3]];
    Table[T[n-k, k], {n,0,12}, {k,0,n}]//Flatten (* G. C. Greubel, May 26 2020 *)

Formula

T(0,k) = A180735(k-1).
T(n,k) - T(n-1,k) = -A078016(k+1).

A355668 Array read by upwards antidiagonals T(n,k) = J(k) + n*J(k+1) where J(n) = A001045(n) is the Jacobsthal numbers.

Original entry on oeis.org

0, 1, 1, 2, 2, 1, 3, 3, 4, 3, 4, 4, 7, 8, 5, 5, 5, 10, 13, 16, 11, 6, 6, 13, 18, 27, 32, 21, 7, 7, 16, 23, 38, 53, 64, 43, 8, 8, 19, 28, 49, 74, 107, 128, 85, 9, 9, 22, 33, 60, 95, 150, 213, 256, 171, 10, 10, 25, 38, 71, 116, 193, 298, 427, 512, 341
Offset: 0

Views

Author

Paul Curtz, Jul 13 2022

Keywords

Examples

			Row n=0 is A001045(k), then for further rows we successively add A001045(k+1).
       k=0  k=2  k=3  k=4  k=5  k=6  k=7  k=8  k=9 k=10
  n=0:  0    1    1    3    5   11   21   43   85  171 ... = A001045
  n=1:  1    2    4    8   16   32   64  128  256  512 ... = A000079
  n=2:  2    3    7   13   27   53  107  213  427  853 ... = A048573
  n=3:  3    4   10   18   38   74  150  298  598 1194 ... = A171160
  n=4:  4    5   13   23   49   95  193  383  769 1535 ... = abs(A140683)
  ...
		

Crossrefs

Antidiagonal sums give A320933(n+1).

Programs

  • Mathematica
    T[n_, k_] := (2^k - (-1)^k + n*(2^(k + 1) + (-1)^k))/3; Table[T[n - k, k], {n, 0, 10}, {k, 0, n}] // Flatten (* Amiram Eldar, Jul 13 2022 *)

Formula

T(n, k) = (2^k - (-1)^k + n*(2^(k + 1) + (-1)^k))/3.
G.f.: (x*(y-1) - y)/((x - 1)^2*(y + 1)*(2*y - 1)). - Stefano Spezia, Jul 13 2022
Previous Showing 51-52 of 52 results.