Skip to content

Summary of block A201

18 sequences
  • A201106: a(n) = binomial(n^2,3)/(2*n).

  • A201157: y-values in the solution to 5*x^2 - 20 = y^2.

  • A201186: Incorrect list of perfect numbers from Robert Recorde’s Whetstone of Witte.

  • A201208: One 1, two 2’s, three 1’s, four 2’s, five 1’s, …

  • A201219: a(1) = 0; for n>1, a(n) = 1 if n is a power of 2, otherwise a(n) = 2.

  • A201243: Number of ways to place 2 non-attacking ferses on an n X n board.

  • A201279: a(n) = 6n^2 + 10n + 5.

  • A201347: Number of n X 2 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.

  • A201455: a(n) = 3*a(n-1) + 4*a(n-2) for n>1, a(0)=2, a(1)=3.

  • A201472: The Griesmer lower bound q_4(5,n) on the length of a linear code over GF(4) of dimension 5 and minimal distance n.

  • A201500: Number of n X 3 0..1 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.

  • A201555: a(n) = C(2*n^2,n^2) = A000984(n^2), where A000984 is the central binomial coefficients.

  • A201629: a(n) = n if n is even and otherwise its nearest multiple of 4.

  • A201630: a(n) = a(n-1) + 2*a(n-2) with n>1, a(0)=2, a(1)=7.

  • A201812: Number of arrays of 4 integers in -n..n with sum zero and equal numbers of elements greater than zero and less than zero.

  • A201864: a(n) = ((F(n-1)+F(n-2))-1)/2 if F(n) is odd, otherwise a(n) = ((F(n-1)+F(n-2))-2)/2, where F(n) = A000045(n) is the n-th Fibonacci number.

  • A201865: Expansion of 1/((1-3*x)*(1+7*x)).

  • A201920: a(n) = 2^n mod 125.