Summary of block A211
Sequences in block A211
Section titled “Sequences in block A211”-
A211004: Number of distinct regions in the set of partitions of n.
-
A211010: Value on the axis “x” of the endpoint of the structure of A211000 at n-th stage.
-
A211012: Total area of all squares and rectangles after 2^n stages in the toothpick structure of A139250, assuming the toothpicks have length 2.
-
A211013: Second 13-gonal numbers: a(n) = n*(11*n+9)/2.
-
A211014: Second 14-gonal numbers: n*(6*n+5).
-
A211164: Number of compositions of n with at most one odd part.
-
A211173: (2n)!^n (modulo 2n+1).
-
A211221: For any partition of n consider the product of the sigma of each element. Sequence gives the maximum of such values.
-
A211227: Row sums of A211226.
-
A211253: Number of (n+1) X (n+1) -6..6 symmetric matrices with every 2 X 2 subblock having sum zero and one or two distinct values.
-
A211322: Number of (n+1) X (n+1) -3..3 symmetric matrices with every 2 X 2 subblock having sum zero and one or two distinct values.
-
A211323: Number of (n+1) X (n+1) -3..3 symmetric matrices with every 2 X 2 subblock having sum zero and three distinct values.
-
A211329: Number of (n+1) X (n+1) -5..5 symmetric matrices with every 2 X 2 subblock having sum zero and one or two distinct values.
-
A211341: a(n) = (n^n mod n!)/n.
-
A211372: Side length of smallest square containing n L’s with short sides 1, 2, …, n.
-
A211374: Product of all the parts in the partitions of n into exactly 2 parts.
-
A211379: Number of pairs of parallel diagonals in a regular n-gon.
-
A211385: Values of n for which product_{p|n, p prime} 1 + 1/p > e^gamma*log(log(n)).
-
A211386: Expansion of 1/((1-2*x)^5*(1-x)).
-
A211412: a(n) = 4*n^4 + 1.
-
A211433: Number of ordered triples (w,x,y) with all terms in {-n,…,0,…,n} and w+2x+4y=0.
-
A211434: Number of ordered triples (w,x,y) with all terms in {-n,…,0,…,n} and w+2x+5y=0.
-
A211435: Number of ordered triples (w,x,y) with all terms in {-n,…,0,…,n} and w+4x+5y=0.
-
A211438: Number of ordered triples (w,x,y) with all terms in {-n,…,0,…,n} and w+2x+2y=0.
-
A211441: Number of ordered triples (w,x,y) with all terms in {-n,…,0,…,n} and w + x + y = 2.
-
A211466: Number of (n+1) X (n+1) -8..8 symmetric matrices with every 2 X 2 subblock having sum zero and one or two distinct values.
-
A211479: Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two, three or four distinct values for every i<=n and j<=n.
-
A211480: Number of ordered triples (w,x,y) with all terms in {-n,…,0,…,n} and w + 2x + 3y = 1.
-
A211481: Number of ordered triples (w,x,y) with all terms in {-n,…,0,…,n} and w+2x+3y=n.
-
A211488: a(n) = Fibonacci(n^2) - Fibonacci(n).
-
A211490: Number of (n+1) X (n+1) -4..4 symmetric matrices with every 2 X 2 subblock having sum zero and one or two distinct values.
-
A211519: Number of ordered triples (w,x,y) with all terms in {1,…,n} and w=2x-3y.
-
A211521: Number of ordered triples (w,x,y) with all terms in {1,…,n} and w + 2x = 4y.
-
A211523: Number of ordered triples (w,x,y) with all terms in {1,…,n} and w+2x=5y.
-
A211525: Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two or four distinct values for every i,j,k<=n.
-
A211534: Number of ordered triples (w,x,y) with all terms in {1,…,n} and w = 3x + 3y.
-
A211538: Number of ordered triples (w,x,y) with all terms in {1,…,n} and 2w=2n-2x-y.
-
A211539: Number of ordered triples (w,x,y) with all terms in {1,…,n} and 2w = 2n - 2x + y.
-
A211540: Number of ordered triples (w,x,y) with all terms in {1..n} and 2w = 3x + 4y.
-
A211545: Number of ordered triples (w,x,y) with all terms in {-n,…-1,1,…,n} and w+x+y>0.
-
A211547: The squares n^2, n >= 0, each one written three times.
-
A211549: Number of (n+1) X (n+1) -9..9 symmetric matrices with every 2 X 2 subblock having sum zero and one or two distinct values.
-
A211562: Number of nonnegative integer arrays of length n+2 with new values 0 upwards introduced in order, and containing the value n-1.
-
A211612: Number of ordered triples (w,x,y) with all terms in {-n,…-1,1,…,n} and w+x+y>=0.
-
A211617: Number of ordered triples (w,x,y) with all terms in {-n,…-1,1,…,n} and 2w+x+y>0.
-
A211623: Number of ordered triples (w,x,y) with all terms in {-n,…-1,1,…,n} and -1<=w+2x+3y<=1.
-
A211661: Number of iterations log_3(log_3(log_3(…(n)…))) such that the result is < 1.
-
A211662: Number of iterations log_3(log_3(log_3(…(n)…))) such that the result is < 2.
-
A211663: Number of iterations log(log(log(…(n)…))) such that the result is < 1.
-
A211664: Number of iterations (…(log_4(log_3(log_2(n))))…) such that the result is < 1.
-
A211665: Minimal number of iterations of log_10 applied to n until the result is < 1.
-
A211666: Number of iterations log_10(log_10(log_10(…(n)…))) such that the result is < 2.
-
A211669: Number of iterations f(f(f(…(n)…))) such that the result is < 2, where f(x) = cube root of x.
-
A211670: Number of iterations (…(f_4(f_3(f_2(n))))…) such that the result is < 2, where f_j(x) := x^(1/j).
-
A211703: a(n) = n + [n/2] + [n/3] + [n/4], where [] = floor.
-
A211710: Number of (n+1) X (n+1) -11..11 symmetric matrices with every 2 X 2 subblock having sum zero and two distinct values.
-
A211715: Number of (n+1) X (n+1) -11..11 symmetric matrices with every 2 X 2 subblock having sum zero and two or four distinct values.
-
A211784: a(n) = n^2 + floor(n^2/2) + floor(n^2/3).
-
A211786: n^3 + floor(n^3/2).
-
A211813: Number of (n+1) X (n+1) -10..10 symmetric matrices with every 2 X 2 subblock having sum zero and two distinct values.
-
A211866: (9^n - 5) / 4.
-
A211885: Number of lower triangular n X n arrays of integers 0 upwards introduced in row major order, with each element unique in its row and column, and containing the value n(n+1)/2-2.
-
A211905: Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal or vertical neighbor, and containing the value n(n+1)/2-2.
-
A211931: Number of distinct regular languages over unary alphabet, whose minimum regular expression has alphabetic width n.
-
A211995: a(n) = floor(7^n / 2^n) mod 2^n.