Skip to content

Summary of block A350

38 sequences
  • A350008: a(n) = Sum_{k=0..n} k^(2*k).

  • A350042: Sum of all the parts in the partitions of n into 3 positive integer parts.

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

  • A350051: Part three of the trisection of A017101: a(n) = 19 + 24*n.

  • A350052: Third part of the trisection of A017077: a(n) = 17 + 24*n.

  • A350054: a(n) = (4^(3*n+2) - 7)/9.

  • A350092: a(n) = floor(x^n) where x = 1 + sqrt(5)/2 = A176055.

  • A350116: Number of ways to partition the set of vertices of a convex {n+8}-gon into 3 non-intersecting polygons.

  • A350229: a(n) is the sum of n and the balanced ternary digits in n.

  • A350271: The covering radius of the first order Reed-Muller code RM(1,n).

  • A350293: a(n) is the 1st saturated vertex Turán number for the cube graph Q_n.

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

  • A350295: 2nd subdiagonal of the triangle A350292.

  • A350327: Maximum domination number of connected graphs with n vertices and minimum degree 2.

  • A350361: 2-tone chromatic number of a tree with maximum degree n.

  • A350362: 2-tone chromatic number of an n-cycle.

  • A350382: a(n) = 9 + 4 * 10^n.

  • A350384: a(n) = (-1728)^n.

  • A350414: a(1)=1; for n > 1, a(n) = a(n-1) + (sum of odd-indexed digits of a(n-1)) - (sum of even-indexed digits of a(n-1)).

  • A350471: The number of days elapsed since the Gregorian (proleptic) date Sunday, December 31, 1 BC on 1/1/n, where 1/1/n is the Gregorian date in the format month/day/year, the New Year’s Day of the year n.

  • A350521: a(n) = 18*n + 4.

  • A350522: a(n) = 18*n + 16.

  • A350547: Maximum size of a set of points taken from a hexagonal section of a hexagonal grid with side length n such that no three selected points form an equilateral triangle.

  • A350551: Convolution of Jacobsthal numbers and Pell numbers.

  • A350558: a(n) = (n-1)!^(2n).

  • A350567: a(n) is the maximum number of key comparisons required to perform an indirect sort of n records with distinct keys using a two-way merge (A. D. Woodall’s mergesort).

  • A350653: a(n) is the number of weak compositions of n into n-1 parts in which at least one part is zero.

  • A350757: a(1)=1; for n>1, a(n) is the smallest number k > a(n-1) such that a(n-1) + k is not a square.

  • A350808: Erroneous version of A105232.

  • A350855: a(0) = 1, a(n) = (n+1)*a(n-1) + (n-2).

  • A350919: a(0) = 9, a(1) = 9, and a(n) = 3*a(n-1) - a(n-2) - 4 for n >= 2.

  • A350920: a(0) = 5, a(1) = 5, and a(n) = 4*a(n-1) - a(n-2) - 4 for n >= 2.

  • A350921: a(0) = 3, a(1) = 3, and a(n) = 6*a(n-1) - a(n-2) - 4 for n >= 2.

  • A350922: a(0) = 2, a(1) = 5, and a(n) = 7*a(n-1) - a(n-2) - 4 for n >= 2.

  • A350923: a(0) = 2, a(1) = 2, and a(n) = 10*a(n-1) - a(n-2) - 4 for n >= 2.

  • A350926: a(0) = 1, a(1) = 17, and a(n) = 23*a(n-1) - a(n-2) - 4 for n >= 2.

  • A350965: a(n) = sqrt(6*A138288(n)^2 - 2).

  • A350995: a(n) = (16*10^n - 1)/3.