Skip to content

Summary of block A326

22 sequences
  • A326011: a(n) = (n+1) * (2^n + 1)^n.

  • A326012: a(n) = (n+1)*(n+2)/2 * (2^n + 1)^n.

  • A326013: a(n) = (n+1) * (3^n + 1)^n.

  • A326157: Squarefree numbers whose product of prime indices is twice their sum of prime indices.

  • A326215: Number of Hamiltonian unlabeled n-vertex graphs with loops.

  • A326247: Number of labeled n-vertex 2-edge multigraphs that are neither crossing nor nesting.

  • A326253: Number of sequences of distinct ordered pairs of positive integers up to n.

  • A326278: Number of n-vertex, 2-edge multigraphs that are not nesting. Number of n-vertex, 2-edge multigraphs that are not crossing.

  • A326289: a(0) = 0, a(n) = 2^binomial(n,2) - 2^(n - 1).

  • A326294: Number of connected simple graphs on a subset of {1..n} with no crossing or nesting edges.

  • A326339: Number of connected simple graphs with vertices {1..n} and no crossing or nesting edges.

  • A326340: Number of maximal simple graphs with vertices {1..n} and no crossing or nesting edges.

  • A326422: Numbers k such that A000045(k) mod 5 is prime.

  • A326494: Number of subsets of {1..n} containing all differences and quotients of pairs of distinct elements.

  • A326501: a(n) = Sum_{k=0..n} (-k)^k.

  • A326576: Total number of graceful labelings of the n-antiprism graph.

  • A326618: a(n) = n^18 + n^9 + 1.

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

  • A326658: a(n) = 6*floor(n/2) + ceiling((n-1)^2/2).

  • A326725: a(n) = (1/2)*n*(5*n - 7); row 5 of A326728.

  • A326822: T(n, k) = k^0 if k = 1 else 0^n. Triangle read by rows, T(n, k) for 0 <= k <= n.

  • A326971: Number of unlabeled set-systems on n vertices whose dual is a weak antichain.