109995

Appears in sequences

• Number of 0..2 arrays of length n+7 with sum less than 8 in any length 8 subsequence (=less than 50% duty cycle).at n=4A212725
• T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum less than 2*k in any length 2k subsequence (=less than 50% duty cycle).at n=32A212729
• Number of 0..2 arrays of length 2*n+4 with sum less than 2*n in any length 2n subsequence (=less than 50% duty cycle).at n=3A212734
• Sum of the 2nd smallest parts of all the partitions of n (2nd smallest part is defined to be 0 when the partition does not have at least 2 distinct parts).at n=39A265248