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.

Showing 1-7 of 7 results.

A089049 Number of ways of writing n as a sum of exactly 4 powers of 2.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 1, 3, 1, 1, 0, 2, 1, 2, 2, 3, 2, 3, 1, 3, 2, 3, 1, 3, 1, 1, 0, 2, 2, 3, 1, 3, 1, 1, 0, 3, 1, 1, 0, 1, 0, 0, 0, 2, 1, 2, 2, 3, 2, 3, 1, 3, 2, 3, 1, 3, 1, 1, 0, 3, 2, 3, 1, 3, 1, 1, 0, 3, 1, 1, 0, 1, 0, 0, 0, 2, 2, 3, 1, 3, 1, 1, 0, 3
Offset: 0

Views

Author

N. J. A. Sloane, Dec 03 2003

Keywords

Comments

The powers do not need to be distinct.

Crossrefs

A089050 Number of ways of writing n as a sum of exactly 5 powers of 2.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 2, 3, 2, 4, 3, 4, 3, 4, 2, 4, 3, 4, 3, 4, 1, 3, 2, 3, 2, 5, 3, 4, 3, 5, 3, 5, 3, 5, 3, 4, 1, 4, 2, 4, 3, 5, 3, 4, 1, 4, 3, 4, 1, 4, 1, 1, 0, 3, 2, 3, 2, 5, 3, 4, 3, 6, 3, 5, 3, 5, 3, 4, 1, 5, 3, 5, 3, 6, 3, 4, 1, 5, 3, 4, 1, 4, 1, 1, 0, 4, 2, 4, 3, 5, 3, 4, 1, 5
Offset: 0

Views

Author

N. J. A. Sloane, Dec 03 2003

Keywords

Comments

The powers do not need to be distinct.

Crossrefs

A089051 Number of ways of writing n as a sum of exactly 6 powers of 2.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Dec 03 2003

Keywords

Comments

The powers do not need to be distinct.

Crossrefs

A342247 Number of partitions of n into seven powers of 2.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 5, 4, 6, 5, 6, 6, 7, 5, 8, 6, 7, 6, 8, 5, 7, 5, 7, 6, 9, 6, 9, 7, 9, 7, 11, 8, 10, 7, 10, 7, 10, 6, 11, 8, 10, 7, 12, 7, 10, 7, 11, 7, 10, 5, 9, 5, 8, 5, 10, 7, 10, 6, 11, 9, 12, 8, 14, 9, 11, 7, 13, 8, 12, 8, 14, 10, 13, 8, 15, 9, 13
Offset: 7

Views

Author

Ilya Gutkovskiy, Mar 07 2021

Keywords

Crossrefs

A342248 Number of partitions of n into eight powers of 2.

Original entry on oeis.org

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

Views

Author

Ilya Gutkovskiy, Mar 07 2021

Keywords

Crossrefs

A342249 Number of partitions of n into nine powers of 2.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 4, 4, 5, 5, 5, 5, 6, 6, 8, 7, 8, 8, 9, 8, 11, 10, 11, 10, 12, 9, 12, 10, 12, 10, 14, 11, 14, 12, 15, 13, 17, 14, 18, 14, 17, 13, 18, 14, 19, 15, 19, 15, 20, 15, 21, 17, 21, 14, 21, 15, 19, 13, 20, 14, 19, 14, 22, 16, 21, 16, 24, 18, 24, 18, 25
Offset: 9

Views

Author

Ilya Gutkovskiy, Mar 07 2021

Keywords

Crossrefs

A347658 Number of partitions of n into at most 3 powers of 2.

Original entry on oeis.org

1, 1, 2, 2, 3, 2, 3, 1, 3, 2, 3, 1, 3, 1, 1, 0, 3, 2, 3, 1, 3, 1, 1, 0, 3, 1, 1, 0, 1, 0, 0, 0, 3, 2, 3, 1, 3, 1, 1, 0, 3, 1, 1, 0, 1, 0, 0, 0, 3, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 3, 2, 3, 1, 3, 1, 1, 0, 3, 1, 1, 0, 1
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 09 2021

Keywords

Crossrefs

Showing 1-7 of 7 results.