A367498 - OEIS

A367498

Lexicographically least increasing sequence of positive integers with the property that no sum of two distinct terms equals a Tribonacci number.

1, 2, 4, 7, 8, 10, 13, 15, 18, 19, 21, 24, 27, 28, 30, 32, 33, 35, 38, 39, 41, 44, 45, 47, 50, 52, 55, 56, 58, 59, 61, 64, 65, 67, 69, 70, 72, 75, 76, 78, 81, 83, 86, 87, 89, 92, 95, 96, 98, 100, 101, 103, 106, 107, 109, 112, 113, 115, 118, 120, 123, 124, 126

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

This sequence is the complement of A367499. In fact, this and A367499 together form the unique partition of the positive integers into two disjoint sets, each having the property that the sum of two distinct elements is never a Tribonacci number.

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

V. E. Hoggatt, Jr., Additive partitions of the positive integers, Fib. Quart. 18 (1980), 220-225.

MAPLE

N:= 500: # for terms <= N

T:= {0, 1}: b:= 0: c:= 1: d:= 1:

a:= b; b:= c; c:= d; d:= a+b+c;

if d > 2*N then break fi;

T:= T union {d}

od:

A:= {1}:

for i from 2 to N do