32703

Appears in sequences

• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=41A024600
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=40A025114
• Numbers having four 7's in base 8.at n=20A043452
• Numbers that contain a single zero in bases 2 and 10.at n=27A118681
• Number of ternary words of length 2n obtained by self-shuffling.at n=6A192296
• Triangle T(n,k), n>=1, 0<=k<=n^2, read by rows: row n gives the coefficients of the chromatic polynomial of the rhombic hexagonal square grid graph RH_(n,n), highest powers first.at n=21A212162
• Triangle T(n,k), n>=1, 0<=k<=n^2, read by rows: row n gives the coefficients of the chromatic polynomial of the staggered hexagonal square grid graph SH_(n,n), highest powers first.at n=21A212194
• Decimal representation of the n-th iteration of the "Rule 71" elementary cellular automaton starting with a single ON (black) cell.at n=7A266850
• Decimal representation of the n-th iteration of the "Rule 207" elementary cellular automaton starting with a single ON (black) cell.at n=7A267774
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 299", based on the 5-celled von Neumann neighborhood.at n=28A287537
• a(n) = (n + 2)*(n^2 + n - 1).at n=31A318765
• Number of partitions of n into colored blocks of equal parts, such that all colors from a set of size six are used and the colors are introduced in increasing order.at n=19A327289
• a(n) = Sum_{k=0..n} binomial(4*n+2,k) * binomial(4*n-k-1,n-k).at n=4A386837