A132399 Number of ordered ways of writing n = i + j, where i is 0 or a prime and j is a triangular number (A000217) >= 0.
1, 1, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 2, 3, 2, 2, 1, 4, 2, 2, 3, 2, 2, 4, 2, 1, 3, 1, 3, 3, 2, 2, 4, 2, 3, 2, 1, 2, 4, 3, 2, 4, 1, 3, 4, 2, 2, 6, 2, 2, 3, 2, 3, 4, 1, 2, 3, 3, 4, 4, 2, 1, 6, 1, 3, 3, 2, 3, 6, 3, 1, 4, 2, 4, 6, 1, 3, 4, 2, 4, 3, 3, 4, 5, 2, 3, 4, 1, 3, 7, 1, 2, 4, 2, 3, 5, 2, 4, 5, 2, 2, 3, 3, 4, 6
Offset: 0
Examples
0 = 0+0, so a(0) = 1, 3 = 3+0 = 2+1 = 0+3, so a(3) = 3. 8 = 7+1 = 5+3 = 2+6, so a(8) = 3.
Links
- T. D. Noe, Table of n, a(n) for n = 0..10000
- T. D. Noe, Plot of A132399(n) for n to 10^6
- Zhi-Wei Sun, Posing to Number Theory List (1)
- Zhi-Wei Sun, Posting to Number Theory List (2)
- Zhi-Wei Sun, Conjectures on sums of primes and triangular numbers, J. Combin. Number Theory 1 (2009) 65-76 and arXiv:0803.3737
Crossrefs
Extensions
Corrected, edited and extended by T. D. Noe, Mar 26 2008
Edited by N. J. A. Sloane, Jan 15 2009
Comments