A168642

View A168642 at the OEIS

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.

• A030528 → x ↦ x/(x+1) (match row sums)
  1 · 1, 2 · 0, 2, 3 · 0, 1, 5, 5 … row sums 1, 3, 5, 11, 21, 43, 85, 171, …
  [−1, 0] nonnegative
• A052553 → x ↦ x+1 (match row sums)
  1 · 1 · 2, 1 · 3, 2 … row sums 1, 1, 3, 5, 11, 21, 43, 85, …
  (−∞, −1] nonnegative
• A128100: Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)). (match row sums)
  A011973 → basis A007318
  1 · 1 · 2, 1 · 3, 2 … row sums 1, 1, 3, 5, 11, 21, 43, 85, …
  A128100 (−∞, −1] nonnegative
• A169803 → x ↦ x+1 (match row sums)
  1 · 2, 1 · 3, 2 · 5, 5, 1 … row sums 1, 3, 5, 11, 21, 43, 85, 171, …
  (−∞, −1] nonnegative
• A113953: A Jacobsthal triangle. (match row sums)
  1 · 0, 1 · 0, 2, 1 · 0, 0, 4, 1 … row sums 1, 1, 3, 5, 11, 21, 43, 85, …
  A113953 (−8, 0] nonnegative
• A026729 → x ↦ x/(x+1) (match row sums)
  1 · 0, 1 · 0, 1, 2 · 0, 0, 2, 3 … row sums 1, 1, 3, 5, 11, 21, 43, 85, …
  [−1, 0] nonnegative
• A128099: Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= k <= floor(n/2)). (match row sums)
  1 · 1 · 1, 2 · 1, 4 … row sums 1, 1, 3, 5, 11, 21, 43, 85, …
  A128099 (−∞, 0] nonnegative