142278

Appears in sequences

• Let S be a strictly monotonic sequence of length 2n and let p and q be subsequences of S each of length n such that the least element belongs to p and every element of S belongs to either p or q. The number of ways to select p such that for any index i the exchange of p(i) and q(i) makes at least one of p and q non-monotonic, is given by a(n).at n=11A137398
• p-INVERT of the positive integers, where p(S) = (1 - S)^3.at n=9A290918
• a(n) = Sum_{d|n} d^(3*n/d - 2).at n=11A308689