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.

A347660 Number of partitions of n into at most 5 powers of 2.

Original entry on oeis.org

1, 1, 2, 2, 4, 4, 5, 4, 7, 5, 7, 5, 8, 5, 7, 4, 8, 5, 8, 5, 10, 6, 8, 4, 9, 5, 8, 4, 8, 4, 5, 1, 8, 5, 8, 5, 11, 6, 8, 4, 11, 6, 9, 4, 9, 4, 5, 1, 9, 5, 8, 4, 9, 4, 5, 1, 8, 4, 5, 1, 5, 1, 1, 0, 8, 5, 8, 5, 11, 6, 8, 4, 12, 6, 9, 4, 9, 4, 5, 1, 11, 6, 9, 4, 10
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 09 2021

Keywords

Crossrefs

Cf. A000079, A000123, A018819, A089050, A089052, A347658, A347659, A347661.

Formula

a(n) = Sum_{k=0..5} A089052(n,k). - Alois P. Heinz, Sep 09 2021

A347661 Number of partitions of n into at most 6 powers of 2.

Original entry on oeis.org

1, 1, 2, 2, 4, 4, 6, 5, 8, 7, 9, 7, 11, 8, 10, 7, 12, 8, 12, 8, 14, 10, 13, 8, 15, 9, 13, 8, 14, 8, 11, 5, 13, 8, 13, 8, 17, 11, 14, 8, 18, 11, 16, 9, 17, 9, 12, 5, 16, 9, 14, 8, 17, 9, 12, 5, 15, 8, 12, 5, 12, 5, 6, 1, 13, 8, 13, 8, 18, 11, 14, 8, 21, 12, 17
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 09 2021

Keywords

Crossrefs

Cf. A000079, A000123, A018819, A089051, A089052, A347658, A347659, A347660.

Formula

a(n) = Sum_{k=0..6} A089052(n,k). - Alois P. Heinz, Sep 09 2021
Previous Showing 11-12 of 12 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.