OFFSET
1,1
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10000 (Terms 1..100 from David Consiglio, Jr.)
David A. Corneth, PARI program
Borys Kuca, Structures in Additive Sequences, arXiv:1804.09594 [math.NT], 2018. See V(2,3).
MATHEMATICA
Nest[Append[#, Function[{m, s}, First@ SelectFirst[Tally[s], And[First@ # > m, Last@ # < 3] &]] @@ {Max@ #, Sort[Total /@ Tuples[#, {2}]]}] &, {2, 3}, 57] (* Michael De Vlieger, Apr 27 2018 *)
PROG
(PARI) \\ See PARI link \\ David A. Corneth, Apr 27 2018
(Python)
terms = [2, 3]
while len(terms) < 100:
options = []
for x in range(len(terms)):
for y in range(x, len(terms)):
options.append(terms[x]+terms[y])
for y in sorted(options):
if options.count(y) == 1 and y > max(terms):
terms.append(y)
break
print(terms)
# David Consiglio, Jr., Apr 18 2018
(Python)
from collections import Counter
def A303600_list(num_terms):
terms = [2, 3]
sum_counts = Counter([4, 5, 6])
next_term = 3
for n in range(2, num_terms):
next_term += 1
while sum_counts[next_term] != 1: next_term += 1
terms.append(next_term)
for term in terms: sum_counts[term + next_term] += 1
return terms
print(A303600_list(59))
# David Radcliffe, Jun 19 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Apr 26 2018
EXTENSIONS
More terms from David Consiglio, Jr., Apr 26 2018
STATUS
approved
