Summary of block A335
Sequences in block A335
Section titled “Sequences in block A335”-
A335013: Middle side lengths of equable Heronian triangles.
-
A335015: Smallest side lengths of equable Heronian triangles (with multiplicity).
-
A335025: Largest side lengths of almost-equilateral Heronian triangles.
-
A335048: Minimum sum of primes (see Comments).
-
A335087: Row sums of A335436.
-
A335111: a(n) = n! * Sum_{k=0..n-1} (-2)^k / k!.
-
A335129: a(n) is the number of distinct lines created inside an n-gon when connecting vertex k to vertex 2k mod n.
-
A335298: a(n) is the squared distance between the points P(n) and P(0) on a plane, n >= 0, such that the distance between P(n) and P(n+1) is n+1 and, going from P(n) to P(n+2), a 90-degree left turn is taken in P(n+1).
-
A335408: Diameter of nearest neighbor interchange distance for free 3-trees.
-
A335439: a(n) = n*(n-1)/2 + 2^(n-1) - 1.
-
A335445: Maximum number of rooks within an n X n chessboard, where each rook has a path to an edge.
-
A335608: Number of sets (in the Hausdorff metric geometry) at each location between two sets defined by a complete bipartite graph K(3,n) (with n at least 2) missing one edge.
-
A335691: A000166(n)^2.
-
A335725: The number of sigma matrices on the set of all endofunctions as a function of domain size n.
-
A335749: a(n) = n!*[x^n] exp(2*x)*(y*sinh(x*y) + cosh(x*y)) and y = sqrt(6).
-
A335753: Maximal length of the shortest walk on any n X n maze that starts in one corner and visits the other three corners.
-
A335807: Number of vertices in the n-th simplex graph of the complete graph on three vertices (K_3).
-
A335843: a(n) is the number of n-digit positive integers with exactly two distinct base 10 digits.
-
A335927: a(n+1) = Sum_{k=1..n} (a(k) + k*(n-k)), with a(1)=1.