43440

Appears in sequences

• a(n) = A000203(n) * A024916(n).at n=32A143238
• Number of arrangements of n+2 nonzero numbers x(i) in -6..6 with the sum of x(i)*x(i+1) equal to zero.at n=3A188246
• T(n,k)=Number of arrangements of n+2 nonzero numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=39A188249
• Number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=5A188252
• Triangle of coefficients of polynomials v(n,x) jointly generated with A210866; see the Formula section.at n=50A210867
• Number of (w,x,y) with all terms in {0,...,n} and 2|w-x| >= max(w,x,y)-min(w,x,y).at n=39A213388
• Matrix inverse of A111636.at n=16A224069
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 43", based on the 5-celled von Neumann neighborhood.at n=39A269878
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 163", based on the 5-celled von Neumann neighborhood.at n=39A270455
• G.f. A(x) satisfies: 1 = Sum_{n>=0} (n+1) * 2^n * ((1+x)^n - A(x))^n.at n=5A337755
• a(n) = phi(p(n)), where phi is Euler's totient function (A000010) and p(n) is the number of partitions of n (A000041).at n=45A366581
• Triangular array read by rows. T(n,k) is the number of ways to choose a size k subset S of [n] and form a labeled acyclic digraph on S. Then form another labeled acyclic digraph on [n]-S. For each pair u in S and v in [n]-S add the directed edge u->v or not, n>=0, 0<=k<=n.at n=16A380336
• Triangular array read by rows. T(n,k) is the number of ways to choose a size k subset S of [n] and form a labeled acyclic digraph on S. Then form another labeled acyclic digraph on [n]-S. For each pair u in S and v in [n]-S add the directed edge u->v or not, n>=0, 0<=k<=n.at n=19A380336