Summary of block A321
Sequences in block A321
Section titled “Sequences in block A321”-
A321003: a(n) = 2^n*(4*3^n-1).
-
A321123: a(n) = 2^n + 2*n^2 + 2*n + 1.
-
A321124: a(n) = (4*n^3 - 6*n^2 + 14*n + 3)/3.
-
A321130: Values of m (mod 25) such that V(m) >= 2, where V(m) indicates the constant convergence speed of the tetration base m.
-
A321131: Values of m (mod 25), where A317905(m) = 1. Values of m (mod 25) such that V(m) = 1, where V(m) indicates the constant convergence speed of the tetration base m.
-
A321153: Possible total numbers of pips when rolling two dice in backgammon.
-
A321180: a(n) = 17*n^2 - 1.
-
A321195: Minimum number of monochromatic Schur triples over all 2-colorings of [n].
-
A321207: a(n) = (n*n!)^3.
-
A321213: a(n) is the number of divisors of n-th Fermat number (A000215).
-
A321220: a(n) = n+2 if n is even, otherwise a(n) = 2*n+1 if n is odd.
-
A321237: Start with a square of dimension 1 X 1, and repeatedly append along the squares of the previous step squares with half their side length that do not overlap with any prior square; a(n) gives the number of squares appended at n-th step.
-
A321340: a(1) = 1; thereafter a(n) = a(n-1) * prime(n-1)^a(n-1).
-
A321358: a(n) = (2*4^n + 7)/3.
-
A321404: Number of non-isomorphic self-dual set multipartitions (multisets of sets) of weight n with no singletons.
-
A321406: Number of non-isomorphic self-dual set systems of weight n with no singletons.
-
A321421: a(n) = 10*(4^n - 1)/3 + 1.
-
A321483: a(n) = 7*2^n + (-1)^n.
-
A321518: Smallest k > 1 such that n^k + k^n is prime, i.e., a Leyland prime, or 0 if no such k exists.
-
A321531: a(n) is the maximum number of distinct directions between n non-attacking rooks on an n X n chessboard.
-
A321573: Row sums of A321624.
-
A321632: Expansion of e.g.f. (1 + sin(x))/exp(x).
-
A321643: a(n) = 5*2^n - (-1)^n.
-
A321672: Number of chiral pairs of rows of length 5 using up to n colors.
-
A321728: Number of integer partitions of n whose Young diagram cannot be partitioned into vertical sections of the same sizes as the parts of the original partition.
-
A321773: Number of compositions of n into parts with distinct multiplicities and with exactly three parts.
-
A321883: Nonnegative integers n for which n! + 1 is not a square.
-
A321994: Number of different chromatic symmetric functions of hypertrees on n vertices.