OFFSET
1,1
COMMENTS
Checked up to 1000000 but haven't found any other values.
A063993(a(n)) = 2. - Reinhard Zumkeller, Jul 20 2012
Without the qualifier "positive" in the Name, sequence A071530 would result. - Jon E. Schoenfield, Jan 01 2020
No further terms <= 3*10^7. - Michael S. Branicky, Dec 17 2021
EXAMPLE
19 = 10 + 6 + 3 = 15 + 3 + 1.
PROG
(Magma) [k:k in [1..350]|#RestrictedPartitions(k, 3, {m*(m+1) div 2:m in [1..200]}) eq 2 ]; // Marius A. Burtea, Jan 01 2020
(Python)
from collections import Counter
from itertools import count, takewhile, combinations_with_replacement as mc
def aupto(N):
tris = takewhile(lambda x: x <= N, (i*(i+1)//2 for i in count(1)))
sum3 = filter(lambda x: x <= N, (sum(c) for c in mc(tris, 3)))
sum3counts = Counter(sum3)
return sorted(k for k in sum3counts if sum3counts[k] == 2)
print(aupto(1000)) # Michael S. Branicky, Dec 17 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 23 2001
EXTENSIONS
Offset changed to 1 by Michel Marcus, Jan 14 2014
STATUS
approved