Summary of block A320
Sequences in block A320
Section titled “Sequences in block A320”-
A320006: a(n) = 1 if n encodes a nonnegative combinatorial game (in a style of A106486), otherwise 0; Characteristic function of A126001.
-
A320259: Terms that are on the y-axis of the square spiral built with 2*k, 2*k+1, 2*k+1 for k >= 0.
-
A320281: Terms that are on the positive x-axis of the square spiral built with 2*k, 2*k+1, 2*k+1 for k >= 0.
-
A320329: Row sums of A174790.
-
A320427: a(n) = floor(3*n/2) + ceiling(n/6) + 9.
-
A320465: a(n) = 2^n - (2^(n-1) mod n), where “mod” is the nonnegative remainder operator.
-
A320468: a(n) = a(n-1) + 20*a(n-2), n >= 2; a(0)=1, a(1)=41.
-
A320469: a(n) = 3*a(n-1) + 10*a(n-2), n >= 2; a(0)=1, a(1)=1.
-
A320505: Index of the first occurrence of n consecutive 0’s in A164349.
-
A320581: a(n) is the number of closed factors of length n in the Fibonacci word.
-
A320604: Chromatic number of the n-polygon diagonal intersection graph.
-
A320661: a(n) = 2^(n+3) - 6*n - 7.
-
A320674: Positive integers m with binary expansion (b_1, …, b_k) (where k = A070939(m)) such that b_i = [m == 0 (mod prime(i))] for i = 1..k (where prime(i) denotes the i-th prime number and [] is an Iverson bracket).
-
A320770: a(n) = (-1)^floor(n/4) * 2^floor(n/2).
-
A320829: Continued fraction of the positive constant t in (1,2) such that the partial denominators form the Beatty sequence {floor((n+1)*t), n >= 0}.
-
A320921: Number of connected graphical partitions of 2n.
-
A320933: a(n) = 2^n - floor((n+3)/2).
-
A320934: Number of chiral pairs of color patterns (set partitions) for a row of length n using 4 or fewer colors (subsets).
-
A320945: a(n) is the number of top-perimeter tiles among all rhombic tilings of the 2n-gon.
-
A320997: An absolute lower bound on the number of components in perfect systems of difference sets (PSDS).