The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027300 Triangular array Q given by rows: Q(n,k) = number of partitions of n that do not contain k as an element; domain: 1 <= k <= n, n >= 1. 1
 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 2, 4, 5, 6, 6, 4, 6, 8, 9, 10, 10, 4, 8, 10, 12, 13, 14, 14, 7, 11, 15, 17, 19, 20, 21, 21, 8, 15, 19, 23, 25, 27, 28, 29, 29, 12, 20, 27, 31, 35, 37, 39, 40, 41, 41, 14, 26, 34, 41, 45, 49, 51, 53, 54, 55, 55, 21, 35 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS FORMULA Q(n, k) = P(n+1, 1) - P(n, k), P given by A027293. Q(n, k) = A000041(n) - A000041(n - k). - Sean A. Irvine, Oct 26 2019 EXAMPLE Triangle begins: 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 2, 4, 5, 6, 6, ... CROSSREFS Cf. A000041, A027293. Sequence in context: A071454 A178139 A039642 * A085313 A065458 A341121 Adjacent sequences: A027297 A027298 A027299 * A027301 A027302 A027303 KEYWORD nonn,tabl AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 07:00 EST 2022. Contains 358649 sequences. (Running on oeis4.)