A035607
identification: the entry's rule defines the sequence for every index; tail: the sequence is the entry's tail after some prefix rows; match_*: finite agreement only.
-
A035607: Table a(d,m) of number of points of L1 norm m in cubic lattice Z^d, read by antidiagonals (d >= 1, m >= 0).
(identification, match triangle)
1 · 1, 2 · 1, 4, 2 · 1, 6, 8, 2 … row sums 1, 3, 7, 17, 41, 99, 239, 577, …
-
A035607 → reverse
(match reversed triangle)
1 · 2, 1 · 2, 4, 1 · 2, 8, 6, 1 … row sums 1, 3, 7, 17, 41, 99, 239, 577, …
-
A122542: Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.
(match reversed triangle)
1 · 0, 1 · 0, 2, 1 · 0, 2, 4, 1 … row sums 1, 1, 3, 7, 17, 41, 99, 239, …
-
A113413: A Riordan array of coordination sequences.
(match reversed triangle)
1 · 2, 1 · 2, 4, 1 · 2, 8, 6, 1 … row sums 1, 3, 7, 17, 41, 99, 239, 577, …
-
A113413 → reverse
(match triangle)
1 · 1, 2 · 1, 4, 2 · 1, 6, 8, 2 … row sums 1, 3, 7, 17, 41, 99, 239, 577, …
-
A266213: Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*bi…
(match triangle)
1 · 1 · 1, 2 · 1, 4, 2 … row sums 1, 1, 3, 7, 17, 41, 99, 239, …
-
A122542 → reverse
(match triangle)
1 · 1 · 1, 2 · 1, 4, 2 … row sums 1, 1, 3, 7, 17, 41, 99, 239, …