Skip to content

Summary of block A327

28 sequences
  • A327021: a(n) = (2*n-1)! / 2^(n-1) if n > 0 and a(0) = 1.

  • A327032: a(n) = T(n, 4) with T(n, k) = Sum_{d|k} phi(d)*binomial(n - 1 + k/d, k/d).

  • A327058: Number of pairwise intersecting set-systems covering n vertices whose dual is a weak antichain.

  • A327059: Number of pairwise intersecting set-systems covering a subset of {1..n} whose dual is a weak antichain.

  • A327094: a(n) is the number of cells in the smallest polyomino that can contain all free n-ominoes.

  • A327128: Number of set-systems with n vertices whose edge-set has cut-connectivity 1.

  • A327146: Number of labeled simple graphs with n vertices and spanning edge-connectivity 2.

  • A327230: Number of non-isomorphic set-systems covering n vertices with at least one endpoint/leaf.

  • A327319: a(n) = binomial(n, 2) + 6*binomial(n, 4).

  • A327335: Number of non-isomorphic set-systems with n vertices and at least one endpoint/leaf.

  • A327411: a(n) = multinomial(2*n+3; 3, 2, 2, …, 2) (n times ‘2’).

  • A327412: a(n) = multinomial(3*n+2; 2, 3, 3, …, 3) (n times ‘3’).

  • A327423: Positive integers k such that tan(k) < 0 (or equivalently, cot(k) < 0).

  • A327425: Number of unlabeled antichains of nonempty sets covering n vertices where every two vertices appear together in some edge (cointersecting).

  • A327436: Number of connected, unlabeled antichains of nonempty subsets of {1..n} covering n vertices with at least one cut-vertex (vertex-connectivity 1).

  • A327440: a(n) = floor(3*n/10).

  • A327470: Maximum valency of the central line in a certain smooth 2D-polarized K3-surface in P^{n+1}.

  • A327492: Partial sums of A327491.

  • A327582: a(n) = (17 * 7^(2*n+1) + 1)/24. Sequence related to the properties of the partition function A000041 modulo a power of 7.

  • A327606: Expansion of e.g.f. exp(x)*(1-x)*x/(1-2*x)^2.

  • A327765: a(n) is the trace of the n-th power of the 2 X 2 matrix [1 2; 3 4].

  • A327767: Period 2: repeat [1, -2].

  • A327770: a(n) = (23*7^(2*n) + 1)/24. Sequence related to the properties of the partition function A000041 modulo a power of 7.

  • A327824: Decimal expansion of the constant factor in the asymptotic for practical numbers (A005153).

  • A327882: a(n) = n*(2*(n-1))! for n > 0, a(0) = 1.

  • A327904: Number of labeled simple graphs with vertices {1..n} such that every edge has a different sum.

  • A327926: a(n) = 99^n.

  • A327999: a(n) = Sum_{k=0..2n}(k!*(2n - k)!)/(floor(k/2)!*floor((2n - k)/2)!)^2.