A249622 a(n) = number of ways to express A117048(n) as the sum of two positive triangular numbers.
1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 2, 1, 1, 3, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 4, 1, 3, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 1, 3, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 3, 1, 2, 1, 2, 1, 1, 6, 2, 1, 1, 1, 1
Offset: 1
Keywords
Examples
a(6) = 2 because A117048(6) = 31 and 31 = 3 + 28 = 10 + 21 (first case of two-way expression). a(22) = 3 because A117048(22) = 181 and 181 = A000217(i) + A000217(k), for {i,k} = {{4, 18}, {7, 17}, {9, 16}} (first case of three-way expression): 181 = 10 + 171 = 28 + 153 = 45 + 136.
Links
- Zak Seidov, Table of n, a(n) for n = 1..10000
Comments