Skip to content

Summary of block A338

22 sequences
  • A338041: Draw n rays from each of two distinct points in the plane; a(n) is the number of regions thus created. See Comments for details.

  • A338042: Draw n rays from each of two distinct points in the plane; a(n) is the number of vertices thus created. See Comments for details.

  • A338043: Draw n rays from each of two distinct points in the plane; a(n) is the number of edges thus created. See Comments for details.

  • A338076: Diagonal terms in the expansion of 1/(1-x-2*y-3*z).

  • A338100: Number of spanning trees in the n X 2 king graph.

  • A338109: a(n)/A002939(n+1) is the Kirchhoff index of the join of the disjoint union of two complete graphs on n vertices with the empty graph on n+1 vertices.

  • A338112: Least number that is both the sum and product of n distinct positive integers.

  • A338186: Expansion of (2-6*x-12*x^2)/((1-x)^2*(1-9*x)).

  • A338206: Inverse of permutation in A160016.

  • A338225: a(n) = F(n+3) * F(n+1) + (-1)^n where F(n) = A000045(n) are the Fibonacci numbers.

  • A338230: Number of ternary strings of length n that contain at least two 0’s and at most one 1.

  • A338293: Number of matchings in the complete binary tree of n rows.

  • A338544: a(n) = (5*floor((n-1)/2)^2 + (4+(-1)^n)*floor((n-1)/2)) / 2.

  • A338550: Number of binary trees of height n such that the number of nodes at depth d equals d+1 for every d = 0..n.

  • A338588: a(n)/A002939(n+1) is the Kirchhoff index of the disjoint union of two complete graphs each on n and n+1 vertices with the empty graph on n+1 vertices.

  • A338660: Number of circle graphs of Gauss diagrams of meander curves with 2n+1 crossings.

  • A338670: Decimal expansion of the sum of the negative and positive local extreme values of the sinc function for x > 0 (negated).

  • A338726: a(n) = Catalan(n) + 2^n - n - 1.

  • A338729: a(n) = number of permutations avoiding the simsum pattern 213 and the classical pattern 321.

  • A338795: Each term of A003215 (centered hexagonal numbers) is multiplied by the corresponding term of A003154 (centered dodecagonal numbers).

  • A338824: Lexicographically earliest sequence of nonnegative integers such that for any distinct m and n, a(m) OR a(m+1) <> a(n) OR a(n+1) (where OR denotes the bitwise OR operator).

  • A338852: a(n) = (7*floor(a(n-1)/3)) + (a(n-1) mod 3) with a(1) = 3.