87890

Appears in sequences

• a(n) = least positive k such that k, k+1, k+2, ..., k+n-1 is a stapled interval of length n, or 0 if no such sequence exists.at n=19A090318
• a(n) = least positive k such that k, k+1, k+2, ..., k+n-1 is a stapled interval of length n, or 0 if no such sequence exists.at n=20A090318
• "Stapled" intervals are defined in A090318. Call a stapled interval "maximal" if it is not a proper subinterval of any other stapled interval. Sequence gives starting points of maximal stapled intervals.at n=5A130170
• "Stapled" intervals are defined in A090318. Call a stapled interval "minimal" if it does not contain any proper stapled subinterval. Sequence gives starting points of minimal stapled intervals.at n=5A130171
• Starting points of stapled intervals.at n=7A130173
• Starting points of stapled intervals of length 17.at n=5A194585
• Number of 0..n arrays x(0..5) of 6 elements with each no smaller than the sum of its three previous neighbors modulo (n+1).at n=9A200670
• a(n) is the largest number that can be expressed as the sum of three triangular numbers in exactly n ways.at n=32A330810
• a(n) is the largest number that can be expressed as the sum of three positive triangular numbers in exactly n ways.at n=33A330811