Summary of block A289
Sequences in block A289
Section titled “Sequences in block A289”-
A289037: Positions of 1 in A289035; complement of A289036.
-
A289121: a(n) = (8 - 2*n + 11*n^2 - 6*n^3 + n^4)/4.
-
A289133: a(n) is the number of odd integers divisible by 9 in ]2*(n-1)^2, 2*n^2[.
-
A289134: a(n) = 21*n^2 - 33*n + 13.
-
A289139: a(n) is the number of odd integers divisible by 7 in ]4*(n-1)^2, 4*n^2[.
-
A289156: Largest area of triangles with integer sides and area = n times perimeter.
-
A289161: Number of 3-cycles in the n X n black bishop graph.
-
A289189: Upper bound for certain restricted sumsets.
-
A289195: a(n) is the number of odd integers divisible by 5 in ]4*(n-1)^2, 4*n^2[.
-
A289207: a(n) = max(0, n-2).
-
A289223: Number of ways to select 2 disjoint point triples from an n X n X n triangular point grid, each point triple forming an 2 X 2 X 2 triangle.
-
A289233: Largest number of disjoint point triples that can be chosen from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle.
-
A289254: a(n) = 4^n - 3*n - 1.
-
A289255: a(n) = 4^n - 2*n - 1.
-
A289296: a(n) = (n - 1)*(2*floor(n/2) + 1).
-
A289382: a(n) = 2^n mod triangular(n).
-
A289399: Total path length of the complete ternary tree of height n.
-
A289404: Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 566”, based on the 5-celled von Neumann neighborhood.
-
A289424: a(n) = length of longest circuit code K(n,3).
-
A289443: a(0) = 2, a(1) = 6; thereafter a(n) = 3*n^2.
-
A289451: Related to number of mesh patterns of length 2 that avoid the pattern 231.
-
A289521: Number of vertices in a planar Apollonian graph at iteration n.
-
A289643: a(n) = n*(2*n+1)*binomial(n+2,n)/3.
-
A289715: The order of the semigroup of orientation-preserving full transformations on n elements.
-
A289719: a(n) = (n/2)*binomial(2*n, n) + 1.
-
A289783: p-INVERT of the (3^n), where p(S) = 1 - S - S^2.
-
A289784: p-INVERT of the (4^n), where p(S) = 1 - S - S^2.
-
A289812: n for which a Factor Pair Latin Square of order n exists.
-
A289870: a(n) = n*(n + 1) for n odd, otherwise a(n) = (n - 1)*(n + 1).
-
A289877: Number of maximal cliques in the n-triangular honeycomb queen graph.
-
A289900: Number of maximal matchings in the n-triangular honeycomb rook graph.
-
A289945: a(n) = Sum_{k=1..n} k!^4.
-
A289947: Values of n for which Sum_{k=1..n} k!^6 is prime.
-
A289948: a(n) = Sum_{k=0..n} k!^3.
-
A289949: a(n) = Sum_{k=0..n} k!^4.
-
A289999: Sierpinski cuboctahedral numbers: a(n) = 16*4^n - 12*2^n + 9.