A353967 a(n) is the number of ways to write n as a sum of distinct terms of A353966.
1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 1, 0, 2, 1, 0, 1, 3, 0, 2, 1, 1, 0, 4, 0, 2, 0, 2, 1, 4, 0, 1, 2, 2, 1, 3, 1, 0, 3, 2, 1, 1, 3, 0, 3, 1, 2, 1, 3, 0, 4, 1, 1, 2, 4, 0, 2, 3, 1, 2, 4, 1, 1, 4, 2, 2, 2, 2, 1, 5, 1, 1, 3, 3, 0
Offset: 0
Keywords
Links
- Rémy Sigrist, Table of n, a(n) for n = 0..10000
- Rémy Sigrist, C++ program
Comments