24818

Appears in sequences

• a(n) = Sum_{i+j+k=n, i,j,k >= 1} tau(i)*tau(j)*tau(k), where tau() = A000005().at n=38A191829
• Antidiagonal sums of the convolution array A213573.at n=9A213575
• Number of n X n 0..6 matrices with each 2X2 subblock idempotent.at n=10A224663
• Number of (n+2)X(1+2) 0..1 arrays with the (lower) medians of each row unequal to its neighbors and each column equal to its neighbors.at n=5A238021
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with the (lower) medians of each row unequal to its neighbors and each column equal to its neighbors.at n=20A238026
• Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), n>=0, ceiling((sqrt(1+8*n)-1)/2)<=k<=n, read by rows.at n=25A316292
• Number T(n,k) of permutations p of [n] such that k is the maximum of the partial sums of the signed up-down jump sequence of 0,p; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns.at n=29A316293
• G.f. A(x) = lim_{n->infinity} (1 - P(n,x))/(-2*x)^n, where P(1,x) = 1/sqrt(1 - 4*x), and P(n+1,x) = 1/sqrt(1 - 4*x + 4*x*P(n,x)) for n >= 1.at n=9A351510
• Numbers k such that w(k), w(k+1), and w(k+2) are all odd, where w is A360519.at n=6A361106