Rhythm combinations in a 16 notes bar.











up vote
4
down vote

favorite












How many combinations are possible between a note-event and a silence-event (i.e. a played note and a pause) over 16 consecutive beats? In other words, if one musical bar is divided into 16 parts (16th notes) of equal duration, filled with either a sound or a silence, how many combinations of the two are possible within the given structure of 16 events?



I hope this is clear enough...sorry, musician here, therefore almost completely unprepared to approach the question. I am not even sure if I am asking about combinations or permutations.



An example: (1= sound 0= pause) .



1000 0010 0011 0011



1111 0000 0111 1010










share|cite|improve this question









New contributor




Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Possible duplicate of Musical and combinatorial proof
    – Micah
    2 hours ago






  • 3




    The linked question applies under the musically reasonable condition that multiple adjacent rests are identical to a longer rest, but multiple adjacent notes are not (i.e., two quarter rests are the same as a half rest, but two quarter notes are different from a half note). If that's what you want, then there are $F(2n+1)$ possible $n$-beat sequences, where $F(k)$ is the $k$th Fibonacci number. So in your case there are $F(33)=3524578$ possible 16-beat sequences.
    – Micah
    2 hours ago















up vote
4
down vote

favorite












How many combinations are possible between a note-event and a silence-event (i.e. a played note and a pause) over 16 consecutive beats? In other words, if one musical bar is divided into 16 parts (16th notes) of equal duration, filled with either a sound or a silence, how many combinations of the two are possible within the given structure of 16 events?



I hope this is clear enough...sorry, musician here, therefore almost completely unprepared to approach the question. I am not even sure if I am asking about combinations or permutations.



An example: (1= sound 0= pause) .



1000 0010 0011 0011



1111 0000 0111 1010










share|cite|improve this question









New contributor




Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Possible duplicate of Musical and combinatorial proof
    – Micah
    2 hours ago






  • 3




    The linked question applies under the musically reasonable condition that multiple adjacent rests are identical to a longer rest, but multiple adjacent notes are not (i.e., two quarter rests are the same as a half rest, but two quarter notes are different from a half note). If that's what you want, then there are $F(2n+1)$ possible $n$-beat sequences, where $F(k)$ is the $k$th Fibonacci number. So in your case there are $F(33)=3524578$ possible 16-beat sequences.
    – Micah
    2 hours ago













up vote
4
down vote

favorite









up vote
4
down vote

favorite











How many combinations are possible between a note-event and a silence-event (i.e. a played note and a pause) over 16 consecutive beats? In other words, if one musical bar is divided into 16 parts (16th notes) of equal duration, filled with either a sound or a silence, how many combinations of the two are possible within the given structure of 16 events?



I hope this is clear enough...sorry, musician here, therefore almost completely unprepared to approach the question. I am not even sure if I am asking about combinations or permutations.



An example: (1= sound 0= pause) .



1000 0010 0011 0011



1111 0000 0111 1010










share|cite|improve this question









New contributor




Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











How many combinations are possible between a note-event and a silence-event (i.e. a played note and a pause) over 16 consecutive beats? In other words, if one musical bar is divided into 16 parts (16th notes) of equal duration, filled with either a sound or a silence, how many combinations of the two are possible within the given structure of 16 events?



I hope this is clear enough...sorry, musician here, therefore almost completely unprepared to approach the question. I am not even sure if I am asking about combinations or permutations.



An example: (1= sound 0= pause) .



1000 0010 0011 0011



1111 0000 0111 1010







combinatorics






share|cite|improve this question









New contributor




Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 1 hour ago









Hans Lundmark

34.3k564110




34.3k564110






New contributor




Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 2 hours ago









Ale

211




211




New contributor




Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Ale is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • Possible duplicate of Musical and combinatorial proof
    – Micah
    2 hours ago






  • 3




    The linked question applies under the musically reasonable condition that multiple adjacent rests are identical to a longer rest, but multiple adjacent notes are not (i.e., two quarter rests are the same as a half rest, but two quarter notes are different from a half note). If that's what you want, then there are $F(2n+1)$ possible $n$-beat sequences, where $F(k)$ is the $k$th Fibonacci number. So in your case there are $F(33)=3524578$ possible 16-beat sequences.
    – Micah
    2 hours ago


















  • Possible duplicate of Musical and combinatorial proof
    – Micah
    2 hours ago






  • 3




    The linked question applies under the musically reasonable condition that multiple adjacent rests are identical to a longer rest, but multiple adjacent notes are not (i.e., two quarter rests are the same as a half rest, but two quarter notes are different from a half note). If that's what you want, then there are $F(2n+1)$ possible $n$-beat sequences, where $F(k)$ is the $k$th Fibonacci number. So in your case there are $F(33)=3524578$ possible 16-beat sequences.
    – Micah
    2 hours ago
















Possible duplicate of Musical and combinatorial proof
– Micah
2 hours ago




Possible duplicate of Musical and combinatorial proof
– Micah
2 hours ago




3




3




The linked question applies under the musically reasonable condition that multiple adjacent rests are identical to a longer rest, but multiple adjacent notes are not (i.e., two quarter rests are the same as a half rest, but two quarter notes are different from a half note). If that's what you want, then there are $F(2n+1)$ possible $n$-beat sequences, where $F(k)$ is the $k$th Fibonacci number. So in your case there are $F(33)=3524578$ possible 16-beat sequences.
– Micah
2 hours ago




The linked question applies under the musically reasonable condition that multiple adjacent rests are identical to a longer rest, but multiple adjacent notes are not (i.e., two quarter rests are the same as a half rest, but two quarter notes are different from a half note). If that's what you want, then there are $F(2n+1)$ possible $n$-beat sequences, where $F(k)$ is the $k$th Fibonacci number. So in your case there are $F(33)=3524578$ possible 16-beat sequences.
– Micah
2 hours ago










1 Answer
1






active

oldest

votes

















up vote
3
down vote













The number of $16$ long sequences of $0$ and $1$ is $2^{16} = 65536$. I think that's what you are asking for.






share|cite|improve this answer





















    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });






    Ale is a new contributor. Be nice, and check out our Code of Conduct.










     

    draft saved


    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2995453%2frhythm-combinations-in-a-16-notes-bar%23new-answer', 'question_page');
    }
    );

    Post as a guest
































    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    3
    down vote













    The number of $16$ long sequences of $0$ and $1$ is $2^{16} = 65536$. I think that's what you are asking for.






    share|cite|improve this answer

























      up vote
      3
      down vote













      The number of $16$ long sequences of $0$ and $1$ is $2^{16} = 65536$. I think that's what you are asking for.






      share|cite|improve this answer























        up vote
        3
        down vote










        up vote
        3
        down vote









        The number of $16$ long sequences of $0$ and $1$ is $2^{16} = 65536$. I think that's what you are asking for.






        share|cite|improve this answer












        The number of $16$ long sequences of $0$ and $1$ is $2^{16} = 65536$. I think that's what you are asking for.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 2 hours ago









        Ethan Bolker

        38.8k543102




        38.8k543102






















            Ale is a new contributor. Be nice, and check out our Code of Conduct.










             

            draft saved


            draft discarded


















            Ale is a new contributor. Be nice, and check out our Code of Conduct.













            Ale is a new contributor. Be nice, and check out our Code of Conduct.












            Ale is a new contributor. Be nice, and check out our Code of Conduct.















             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2995453%2frhythm-combinations-in-a-16-notes-bar%23new-answer', 'question_page');
            }
            );

            Post as a guest




















































































            Popular posts from this blog

            mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

            How to change which sound is reproduced for terminal bell?

            Can I use Tabulator js library in my java Spring + Thymeleaf project?