A333868 The number of ways to write n as the difference of two k-simplex numbers for k >= 2.
1, 3, 3, 4, 5, 4, 3, 6, 7, 4, 4, 4, 5, 9, 4, 4, 5, 5, 7, 9, 4, 4, 4, 6, 4, 7, 7, 4, 7, 5, 3, 6, 6, 11, 9, 4, 4, 6, 4, 4, 6, 4, 5, 11, 5, 4, 4, 6, 6, 6, 5, 4, 7, 12, 8, 6, 4, 4, 6, 4, 4, 8, 5, 8, 9, 4, 4, 7, 8, 4, 5, 4, 5, 8, 4, 8, 9, 4, 5, 8, 4, 6, 10, 7, 4, 6
Offset: 2
Keywords
Examples
The a(9) = 6 ways to write 9 as the difference of k-simplex numbers for k > 2 are: C(5, 2) - C(2, 2) = 10 - 1, C(6, 2) - C(4, 2) = 15 - 6, C(10, 2) - C(9, 2) = 45 - 36, C(5, 3) - C(3, 3) = 10 - 1, C(9, 8) - C(7, 8) = 9 - 0, and C(10, 9) - C(9, 9) = 10 - 1, where C(n,k) = binomial(n,k) = A007318(n,k).
Links
- Peter Kagey, Table of n, a(n) for n = 2..5000
Comments