A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.

A096772

A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.

Terms

    a(0) =1a(1) =2a(2) =5a(3) =14a(4) =33a(5) =72a(6) =125a(7) =219a(8) =376a(9) =573a(10) =745a(11) =1209a(12) =1557a(13) =2442a(14) =3098a(15) =4048a(16) =5298a(17) =6704a(18) =7839a(19) =10987a(20) =12332a(21) =15465a(22) =19144a(23) =24546a(24) =28974a(25) =34406a(26) =37769a(27) =45864a(28) =50877a(29) =61372

External references