cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A338848 Number of compositions (ordered partitions) of n into distinct powers of 3.

Original entry on oeis.org

1, 1, 0, 1, 2, 0, 0, 0, 0, 1, 2, 0, 2, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 2, 6, 0, 0, 0, 0, 2, 6, 0, 6, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 2, 6, 0, 0, 0, 0, 2, 6
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 11 2020

Keywords

Crossrefs

Programs

  • PARI
    a(n) = my(c=0,r); while(n, [n,r]=divrem(n,3); if(r==2,return(0)); c+=r); c!; \\ Kevin Ryde, Nov 14 2020

Formula

a(n) = A039966(n) * A062756(n)!. - Kevin Ryde, Nov 14 2020

A357237 Number of compositions (ordered partitions) of n into distinct parts of the form 2^j - 1.

Original entry on oeis.org

1, 1, 0, 1, 2, 0, 0, 1, 2, 0, 2, 6, 0, 0, 0, 1, 2, 0, 2, 6, 0, 0, 2, 6, 0, 6, 24, 0, 0, 0, 0, 1, 2, 0, 2, 6, 0, 0, 2, 6, 0, 6, 24, 0, 0, 0, 2, 6, 0, 6, 24, 0, 0, 6, 24, 0, 24, 120, 0, 0, 0, 0, 0, 1, 2, 0, 2, 6, 0, 0, 2, 6, 0, 6, 24, 0, 0, 0, 2, 6, 0, 6, 24, 0, 0, 6, 24
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 19 2022

Keywords

Comments

Let b(n) the number of parts in partitions of n into distinct parts of the form 2^j-1, then a(n) = factorial(b(n)).

Crossrefs

Previous Showing 11-12 of 12 results.