Summary of block A340
Sequences in block A340
Section titled “Sequences in block A340”-
A340000: Solution to stacking stones puzzle (see Comments).
-
A340163: For n>=1, smallest integer k such that for all m>=k: m^(1/n)+(m+1)^(1/n) >= (2^n*m+2^(n-1)-1)^(1/n).
-
A340228: a(n) is the sum of the lengths of all the segments used to draw a rectangle of height 2^(n-1) and width n divided into 2^(n-1) rectangles of unit height, in turn, divided into rectangles of unit height and lengths corresponding to the parts of the compositions of n.
-
A340257: a(n) = 2^n * (1+n*(n+1)/2).
-
A340266: The number of degrees of freedom in a quadrilateral cell for a serendipity finite element space of order n.
-
A340301: a(n) = n * floor(log_2(n)).
-
A340318: Minimum size of a partial order that contains all partial orders of size n.
-
A340375: a(n) = 1 if n is of the form 2^i - 2^j with i >= j, and 0 otherwise.
-
A340395: a(n) = A340131(A001006(n)).
-
A340445: Number of partitions of n into 3 parts that are not all the same.
-
A340448: Radio number of the cycle graph C_n.
-
A340495: Records in first differences of A340494.
-
A340498: Where 2^n appears in A340488 for the first time.
-
A340507: a(n) = floor(sqrt(2*n)) - A003056(n).
-
A340519: Smallest order of a non-abelian group with a center of order n.
-
A340528: Radio number of the path graph P_n.
-
A340536: Digital root of 2*n^2.
-
A340546: Number of main classes of diagonal Latin squares of order 2n that contain a one-plane symmetric square.
-
A340627: a(n) = (11*2^n - 2*(-1)^n)/3 for n >= 0.
-
A340648: a(n) is the maximum number of nonzero entries in an n X n sign-restricted matrix.
-
A340709: Let k = n/2 + floor(n/4) if n is even, otherwise (3n+1)/2; then a(n) = A093545(k).
-
A340745: a(n) is the number of “add the square” iterations required to reach or exceed 1 starting at 1/n.
-
A340849: a(n) = A001045(n) + A052928(n).