Summary of block A328
Sequences in block A328
Section titled “Sequences in block A328”-
A328034: a(n) = 3n minus the largest power of 2 not exceeding 3n.
-
A328085: Column sums of triangle A328084.
-
A328152: a(n) is the number of squares of side length greater than 1 having vertices at the points of an n X n grid of dots.
-
A328154: G.f. A(x) satisfies: A(x) = A(x^2) + x / (1 + x)^2.
-
A328262: a(n) = a(n-1)*3/2, if noninteger then rounded to the nearest even integer, with a(1) = 1.
-
A328263: a(n) = number of letters in a(n-1) (in Polish), with a(1) = 1.
-
A328283: The maximum number m such that m white, m black and m red queens can coexist on an n X n chessboard without attacking each other.
-
A328284: An extension of the Jacobsthal numbers: 0, 0, 1, followed by A001045.
-
A328286: Expansion of e.g.f. -log(1 - x - x^2/2).
-
A328604: G.f.: (1 + 7*x) / (1 - 2*x - 9*x^2).
-
A328606: Expansion of (1 + 9*x) / (1 - 2*x - 11*x^2).
-
A328683: Positive integers that are equal to 99…99 (repdigit with n digits 9) times the sum of their digits.
-
A328778: Number of indecomposable closed walks of length 2n along the edges of a cube based at a vertex.
-
A328873: Maximal size of a set of pairwise mutually orthogonal diagonal Latin squares of order n.
-
A328881: a(n+3) = 2^n - a(n), a(0)=a(2)=1, a(1)=0 for n >= 0.
-
A328890: Number of acyclic edge covers of the complete bipartite graph K_{n,2}.
-
A328943: a(n) = 2 + (n mod 4).
-
A328979: Trajectory of 0 under repeated application of the morphism 0 -> 0010, 1 -> 1010.
-
A328985: First differences of A328984.
-
A328987: The sequence C(n) defined in the comments (A and B smallest missing numbers, offset 0).
-
A328990: a(n) = (3*b(n) + b(n-1) + 1)/2, where b = A005409.
-
A328994: a(n) = n^2*(1+n)*(1+n^2)/4.