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-1 of 1 results.

A302111 a(n) is the number of ways n can be written as a sum of two (not necessarily distinct) terms of A303600.

Original entry on oeis.org

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

Views

Author

David A. Corneth, Apr 27 2018

Keywords

Comments

Some numbers can be written in more than one way as a sum of two terms of A303600. This gives a(n) > 1. Some numbers can't be written in more than one way as a sum of two terms of A303600. This gives a(n) = 0. n such that a(n) is 1 gives terms of A303600.

Crossrefs

Cf. A303600.
Showing 1-1 of 1 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.