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!)
 A349552 a(n) is the number of halving partitions of n (see Comments for definition). 2
 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 1, 3, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Let S(m) = {f(m/2)), c(m/2) : m >= 1}, where f = floor and c = ceiling. A halving partition of n is a partition p(1) + p(2) + ... + p(k) of n such that p(1) is in S(n) and p(i) is in S(p(i-1)) for i = 1, 2, ..., k. The basic idea is that each term after the first is about half of the preceding term. LINKS EXAMPLE a(9) counts these 2 partitions: c(9/2) + f(5/2) + f(2/2} + c(1/2) = 5 + 3 + 1; f(9/2) + f(5/2) + f(2/2) + c(1/2) = 4 + 2 + 1 + 1. a(13) counts these: c(13/2) + c(7/2) + f(4/2) = 7 + 4 + 2; c(13/2) + f(7/2) + c(3/2) + f(2/2) = 7 + 3 + 2 + 1; f(13/2) + f(6/2) + c(3/2) + f(2/2) + c(1/2) = 6 + 3 + 2 + 1 + 1. CROSSREFS Sequence in context: A191373 A322873 A332897 * A026904 A057828 A082498 Adjacent sequences: A349549 A349550 A349551 * A349553 A349554 A349555 KEYWORD nonn,more AUTHOR Clark Kimberling, Dec 26 2021 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 November 30 06:18 EST 2022. Contains 358431 sequences. (Running on oeis4.)