Skip to content

Summary of block A323

33 sequences
  • A323048: Sums of no more than two 5-smooth numbers.

  • A323162: a(n) = 1 if both n and n-1 are composite, 0 otherwise.

  • A323178: a(n) = 1 + 100*n^2 for n >= 0.

  • A323202: Expansion of (1 - x) * (1 - x^3) / (1 - x^4) in powers of x.

  • A323218: a(n) = (4*n^3 + 30*n^2 + 50*n)/3 + 1.

  • A323221: a(n) = n*(n + 5)*(n + 7)/6 + 1.

  • A323225: a(n) = ((2^n*n + i*(1 - i)^n - i*(1 + i)^n))/4, where i is the imaginary unit.

  • A323227: a(n) = [x^n] (1 - 2*x + x^2 - 2*x^3 + x^4)/((1 - x)^2*(1 - 2*x)).

  • A323229: a(n) = binomial(2*n, n+1) + 1.

  • A323230: a(n) = binomial(2*(n - 1), n - 1) + 1.

  • A323337: Number of minimal total dominating sets in the n-Bruhat graph.

  • A323383: Proper divisors of 24.

  • A323395: a(n) is the smallest n-powerful number, that is, the smallest positive integer such that {1,2,…,a(n)} admits a partition into A and B so that the sum of the j-th powers of A equals the sum of the j-th powers of B, for all j = 0, 1, …, n.

  • A323397: a(n) = (4^n + 15*n - 1)/9.

  • A323416: a(n) = (n-1)! * (10^n - 1) / 9.

  • A323417: When a prime-based mapping reaches 0.

  • A323457: Largest cardinality of any set that is “special above n”.

  • A323516: Number of minimum total dominating sets in the n-Sierpinski tetrahedron graph.

  • A323547: n-th digit in the base-2 expansion of 1/n.

  • A323591: n-th digit after the radix point in the base-3 expansion of 1/n.

  • A323592: n-th digit in the base-4 expansion of 1/n.

  • A323610: List of 5-powerful numbers (for the definition of k-powerful see A323395).

  • A323614: List of 7-powerful numbers (for the definition of k-powerful see A323395).

  • A323639: a(n) = 3*(10^n - 4)/9.

  • A323715: a(n) = Product_{k=0..n} (2^k + 3^k).

  • A323716: a(n) = Product_{k=0..n} (3^k + 1).

  • A323723: a(n) = (-2 - (-1)^n*(-2 + n) + n + 2*n^3)/4.

  • A323724: a(n) = n*(2*(n - 2)*n + (-1)^n + 3)/4.

  • A323735: a(n) is the largest minimal distance of a binary LCD [n,2] code.

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

  • A323824: a(0) = 6; thereafter a(n) = 4*a(n-1) + 1.

  • A323847: a(n) = (n-1)*(n-2)*(n^2+9*n+12)/24.

  • A323924: Polycyclic aromatic hydrocarbons (for precise definition see He and He, 1986).