110361

Appears in sequences

• Number of protruded partitions of n with largest part at most 2.at n=21A005403
• Numbers n such that the smallest possible number of multiplications required to compute x^n is by 2 less than the number of multiplications obtained by Knuth's power tree method.at n=19A115614
• Number of compositions of n whose run-lengths are not weakly increasing.at n=18A332871
• T(n, k) is the total number of symmetric peaks in all partitions of n with exactly k blocks, n >= 3, 2 <= k <= n-1.at n=46A373288