Summary of block A319
Sequences in block A319
Section titled “Sequences in block A319”-
A319006: Sum of the next n positive integers repeated (A008619).
-
A319007: Sum of the next n nonnegative integers repeated (A004526).
-
A319013: a(n) is the sum over each permutation of S_n of the least element of the descent set.
-
A319054: Maximum product of an aperiodic integer partition of n.
-
A319116: Signs of the Maclaurin coefficients of 1/(exp(x) + Pi/2).
-
A319117: Sign of the n-th Maclaurin coefficient of 1/(exp(x) + exp(1)/2).
-
A319127: Crossing number of the complete bipartite graph K_{6,n}.
-
A319128: Interleave n*(3*n - 2), 3*n^2 + n - 1, n=0,0,1,1, … .
-
A319158: Given an equilateral triangular grid with side n, containing n(n+1)/2 points, a(n) is the minimal number of points to be selected, such that any equilateral triangle of points will include at least one of the selection, if the triangle has the same orientation as the grid.
-
A319159: Given an equilateral triangular grid with side n, containing n(n+1)/2 points, a(n) is the minimal number of points to be selected, such that any equilateral triangle of points will include at least one of the selection.
-
A319196: a(n) = 2^(n-1)*Fibonacci(n-3), n >= 0.
-
A319253: Number of doubly sorted permutations of [2n].
-
A319259: Minimal number of straight lines of a covering tree needed to cover n X n X n points arranged in a 3-D grid.
-
A319279: Numbers that are congruent to {0, 3, 7, 10} mod 12.
-
A319280: Numbers that are congruent to {0, 4, 7, 11} mod 12.
-
A319288: a(n) is the smallest k such that A319284(n, k) >= A319284(n, j) for all 0 <= j <= n.
-
A319371: Numbers k such that the characteristic polynomial of a wheel graph of k nodes has exactly one monomial with vanishing coefficient.
-
A319384: a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), a(0)=1, a(1)=5, a(2)=9, a(3)=21, a(4)=29.
-
A319390: a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), a(0)=1, a(1)=2, a(2)=3, a(3)=6, a(4)=8.
-
A319451: Numbers that are congruent to {0, 3, 6} mod 12; a(n) = 3*floor(4*n/3).
-
A319452: Numbers that are congruent to {0, 3, 6, 10} mod 12.
-
A319491: Number of minimal non-word-representable connected graphs on n vertices.
-
A319556: a(n) gives the alternating sum of length n, starting at n: n - (n+1) + (n+2) - … + (-1)^(n+1) * (2n-1).
-
A319575: a(n) = (2/3)*n*(n^3 - 6*n^2 + 11*n - 3).
-
A319578: a(n) = (1/3)*(n+2)^2*(3*n+3)!/(n+2)!^3.
-
A319610: a(n) is the minimal number of successive OFF cells that appears in n-th generation of rule-30 1D cellular automaton started from a single ON cell.
-
A319621: Number of non-isomorphic connected antichain covers of n vertices by distinct sets whose dual is also an antichain of (not necessarily distinct) sets.
-
A319622: Number of non-isomorphic connected weight-n antichains of distinct sets whose dual is also an antichain of (not necessarily distinct) sets.
-
A319624: Number of non-isomorphic connected antichain covers of n vertices by distinct sets whose dual is also an antichain of distinct sets.
-
A319625: Number of non-isomorphic connected weight-n antichains of distinct sets whose dual is also an antichain of distinct sets.
-
A319634: Number of non-isomorphic antichain covers of n vertices by distinct sets whose dual is also an antichain of (not necessarily distinct) sets.
-
A319635: Number of non-isomorphic weight-n antichains of distinct multisets whose dual is also an antichain of (not necessarily distinct) multisets.
-
A319638: Number of non-isomorphic weight-n antichains of distinct sets whose dual is also an antichain of distinct sets.
-
A319640: Number of non-isomorphic antichain covers of n vertices by distinct sets whose dual is also an antichain of distinct sets.
-
A319645: Number of non-isomorphic weight-n antichains of distinct multisets whose dual is a chain of distinct multisets.
-
A319701: Filter sequence for sequences that are constant for all odd terms >= 3.
-
A319702: Filter sequence for sequences that are constant for all even terms >= 2.
-
A319749: a(n) is the numerator of the Heron sequence with h(0)=3.
-
A319764: Number of non-isomorphic intersecting set systems of weight n with empty intersection.
-
A319767: Number of non-isomorphic intersecting set systems spanning n vertices whose dual is also an intersecting set system.
-
A319924: a(n) = A143565(2n,n) for n > 0, a(0) = 1.
-
A319926: Isomer counts of compound perfect squared squares.
-
A319948: a(n) = Product_{i=1..n} floor(3*i/2).
-
A319949: a(n) = Product_{i=1..n} floor(4*i/3).
-
A319950: a(n) = Product_{i=1..n} floor(5*i/3).
-
A319976: Dimensions of certain ideals arising in the study of projective Reed-Muller codes.