Skip to content

Summary of block A322

44 sequences
  • A322011: Number of distinct chromatic symmetric functions of spanning hypergraphs (or antichain covers) on n vertices.

  • A322015: If A003188(n+1) < A003188(n), then a(n) = n+1, otherwise a(n) = 0.

  • A322016: a(0) = 0; for n > 0, if A003188(n) > A003188(n-1) then a(n) = n-1, otherwise a(n) = 0.

  • A322042: Maximum edge-distance of a point in the quotient graph E/nE from the origin (see A322041 for further information).

  • A322051: a(n) is the number of initial terms in the row of length 2^n of A322050 that agree with the limiting sequence A322049.

  • A322059: Expansion of generating function related to a certain class of combinatorial objects.

  • A322067: Size of the free distributive lattice on the meet semilattice of partitions.

  • A322108: Distance of n-th iteration in an alternating rectangular spiral.

  • A322116: Main diagonal of triangle A321600; a(n) = A321600(n,n-1) for n >= 1.

  • A322125: Minimum number of shaded cells in an n X n Hitori solution grid.

  • A322129: Digital roots of A057084.

  • A322142: Powernacci numbers: a(n) = 2^(a(n-1) + a(n-2)) with a(0) = 0 and a(1) = 1.

  • A322171: Expansion of x*(3 + 5*x + x^2 + x^3)/((1 - x)^2*(1 + x^2)).

  • A322250: Take binary expansion of 2n-1 and delete the trailing block of 1’s, except if the number is 11…1, leave a single 1.

  • A322271: Smallest multiplication factors f, prime or 1, for all b (mod 24), coprime to 24, so that b*f is a nonzero square mod 8 and mod 3.

  • A322284: Number of nonequivalent ways to place n nonattacking kings on a 2 X 2n chessboard under all symmetry operations of the rectangle.

  • A322399: Number of non-isomorphic 2-edge-connected clutters spanning n vertices.

  • A322406: a(n) = n + n*n^n.

  • A322417: a(n) - 2*a(n-1) = period 2: repeat [3, 0] for n > 0, a(0)=5, a(1)=13.

  • A322450: Number of permutations of [2n] in which the size of the last cycle is n and the cycles are ordered by increasing smallest elements.

  • A322462: Numbers on the 0-1-12 line in a spiral on a grid of equilateral triangles.

  • A322465: Numbers on the 0-9-10-line in a spiral on an equilateral triangular lattice.

  • A322489: Numbers k such that k^k ends with 4.

  • A322490: Numbers k such that k^k ends with 7.

  • A322496: Number of tilings of a 3 X n rectangle using V (2m+1)-ominoes (m >= 0) in standard orientation.

  • A322546: Numbers k such that every integer partition of k contains a 1 or a prime power.

  • A322556: The number of eigenvectors with eigenvalue 1 summed over all linear operators on the vector space GF(2)^n.

  • A322573: G.f. = g(f(x)), where f(x) = g.f. of Fibonacci sequence A000045 and g(x) = g.f. of Jacobsthal sequence A001045.

  • A322593: a(n) = 2^n + 2*n^2 + 1.

  • A322594: a(n) = (4*n^3 + 12*n^2 - 4*n + 3)/3.

  • A322595: a(n) = (n^3 + 9*n + 14*n + 9)/3.

  • A322597: a(n) = (4*n^3 - 6*n^2 + 20*n + 3)/3.

  • A322598: a(n) is the number of unlabeled rank-3 graded lattices with 3 coatoms and n atoms.

  • A322675: a(n) = n * (4*n + 3)^2.

  • A322677: a(n) = 16*n*(n+1)*(2*n+1)^2.

  • A322745: a(n) = n * (16*n^2+20*n+5)^2.

  • A322783: a(n) = 1 - n + (2^(n+2) - (-1)^n)/3.

  • A322796: a(n) = Kronecker symbol (6/n).

  • A322829: a(n) = Jacobi (or Kronecker) symbol (n/21).

  • A322830: a(n) = 32*n^3 + 48*n^2 + 18*n + 1.

  • A322832: Values x + y, where the ordered pairs (x,y) are sorted first by maximal coordinate and then lexicographically.

  • A322925: Expansion of x*(1 + 2*x + 10*x^2)/((1 - x^2)*(1 - 10*x^2)).

  • A322938: a(n) = binomial(2*n + 2, n + 2) - 1.

  • A322940: a(n) = [x^n] (4*x^2 + x - 1)/(2*x^2 + 3*x - 1).