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

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

Author

David A. Corneth, Apr 27 2018

Keywords

• nonn

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.