Summary of block A230
Sequences in block A230
Section titled “Sequences in block A230”-
A230018: a(n) = (9*n^3 + 5*n)/2.
-
A230056: G.f.: Sum_{n>=0} (n+3)^n * x^n / (1 + (n+3)*x)^n.
-
A230059: Conjectural number of irreducible zeta values of weight 2*n+1 and depth three.
-
A230071: Sum over all permutations without double ascents on n elements and each permutation contributes 2 raised to the power of the number of double descents.
-
A230089: If n is divisible by 4 then 4, if n is divisible by 2 then 2, otherwise n.
-
A230096: Number of tilings of an n X 1 rectangle (using tiles of dimension 1 X 1 and 2 X 1) that share no tile at the same position with their mirrored image.
-
A230128: The number of multinomial coefficients over partitions with value equal to 4.
-
A230267: Coins left after packing 5 curves coins patterns into fountain of coins base n.
-
A230269: Number of n X 2 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.
-
A230281: The least possible number of intersection points of the diagonals in the interior of a convex n-gon with all diagonals drawn.
-
A230300: a(n) = n + wt(n-1), where wt() = A000120() is the binary weight.
-
A230380: The size of an optimal binary code of length n and edit distance 4.
-
A230381: The size of an optimal binary code of length n and edit distance 5.
-
A230539: a(n) = 3*n*2^(3*n-1).
-
A230540: a(n) = 2*n*3^(2*n-1).
-
A230564: Rational rank of the n-th taxicab elliptic curve x^3 + y^3 = A011541(n).
-
A230579: a(n) = 2^n mod 341.
-
A230585: First terms of first rows of zigzag matrices as defined in A088961.
-
A230603: Generalized Fibonacci word. Binary complement of A221150.
-
A230628: Maximum number of colors needed to color a planar map of several empires, each empire consisting of n countries.
-
A230629: a(0) = 0; thereafter a(n) = (1 + a(floor(n/2))) mod 3.
-
A230630: a(1)=0; thereafter a(n) = (1 + a(floor(n/2))) mod 3.
-
A230641: a(n) = n + (sum of digits in base-3 representation of n).
-
A230664: a(n) = floor(3^n/n^2).
-
A230748: Duplicate of A078607.
-
A230862: Start with 0; each term when spelled out must start with the last letter of the previous term and must be the smallest such number that is greater than the previous term.
-
A230864: log2*(n) (version 3): number of iterations log_2(log_2(log_2(…(n)…))) required for the result to be <= 1.
-
A230900: a(n) = 2^Lucas(n).
-
A230928: Number of black-square subarrays of (n+2) X (1+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.
-
A230929: Number of black-square subarrays of (n+2) X (2+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.