Summary of block A344
Sequences in block A344
Section titled “Sequences in block A344”-
A344057: a(n) = (2*n)! / CatalanNumber(n - 1) for n >= 1 and a(0) = 1.
-
A344109: a(n) = (5*2^n + 7*(-1)^n)/3.
-
A344114: a(n) = 2^(n^2) - n!.
-
A344215: a(n) = n*(3^(n-1) - 2^(n-1)).
-
A344236: Number of n-step walks from a universal vertex to the other on the diamond graph.
-
A344260: a(n) is the number of relations from an n-element set into a set of at most n elements.
-
A344261: Number of n-step walks from one of the vertices with degree 3 to itself on the four-vertex diamond graph.
-
A344399: a(n) = 4^n*binomial(n - 1/2, -1/2)*(n^2 + 1).
-
A344420: a(n) = floor(n/11).
-
A344517: Minimum diameter of 4-regular circulant graphs of order n.
-
A344564: a(n) = [x^n] -3/(2*x - 1)^5.
-
A344674: a(n) is the maximum value such that there is an n X n binary orthogonal matrix with every row having at least a(n) ones.
-
A344747: a(n) = (1/6)*(3^n + (-2)^n - 1).
-
A344805: Numbers that are the sum of six squares in one or more ways.
-
A344853: a(n) = n minus (sum of digits of n in base 3).
-
A344866: Number of polygons formed when every pair of vertices of a regular (2n-1)-gon are joined by an infinite line.
-
A344907: Number of polygon edges formed when every pair of vertices of a regular (2n-1)-gon are joined by an infinite line.
-
A344919: a(n) = n^n - n*(n + 1) / 2.
-
A344920: The Worpitzky transform of the squares.