57074

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=19A049903
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DDUU's starting at level 2.at n=33A135329
• a(n) = (A242804(n)-9)/12.at n=5A257044
• Sum of squares of parts of the partitions of 2n into two squarefree parts.at n=40A280316
• Number of subsets of {1,..,2n} for which the reciprocal of the modular-part product is also a modular-part product.at n=7A329777