Skip to content

Summary of block A324

19 sequences
  • A324015: Number of nonempty subsets of {1, …, n} containing no two cyclically successive elements.

  • A324128: a(n) = 2*n*Fibonacci(n) + (-1)^n + 1.

  • A324129: a(n) = n*Fibonacci(n) + ((-1)^n + 1)/2.

  • A324148: Maximal length of the shortest circular witness over all representable sets of binary vectors of length n.

  • A324149: Least integer x such that every set of the length-n subwords of some binary word y is achievable by taking the subwords of some word of length <= x.

  • A324151: a(n) = (2/((n+1)*(n+2)))*multinomial(3*n;n,n,n).

  • A324160: Number of zero-containing nonnegative integers <= n.

  • A324161: Number of zerofree nonnegative integers <= n.

  • A324172: Number of subsets of {1,…,n} that cross their complement.

  • A324265: a(n) = 5*343^n.

  • A324266: a(n) = 2*49^n.

  • A324269: a(n) = 3*11^(2*n).

  • A324272: a(n) = 2*13^(2*n).

  • A324467: Three times the binary weight of n: 3*A000120(n).

  • A324471: a(n) = 10 mod n.

  • A324472: a(n) = 1000 mod n.

  • A324476: Packing numbers for n-tripods.

  • A324560: Numbers > 1 where the minimum prime index is less than or equal to the number of prime factors counted with multiplicity.

  • A324969: Number of unlabeled rooted identity trees with n vertices whose non-leaf terminal subtrees are all different.