Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #22 Oct 08 2020 03:31:48
%S 5,9,11,16,17,18,22,25,26,28,29,34,35,36,38,39,41,43,46,48,49,52,53,
%T 54,55,57,58,59,61,62,63,67,69,70,71,73,75,76,78,79,80,81,82,83,84,86,
%U 87,89,90,93,96,97,99,100,101,102,104,105,106,112,113,115,116,117,118,120,124,126,128
%N Let M_k denote the addition table for the first k terms of A337656. M_k contains exactly k*(k+1)/2 distinct numbers, and these numbers are a subset of the entries in M_{k+1}. The present sequence consists of the numbers that never appear in any M_k.
%C Note that if A337656(k+1) = t, all entries in M_{k+1} that are not entries in M_k are >= t.
%H Rémy Sigrist, <a href="/A337657/b337657.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A337657/a337657.txt">C++ program for A337657</a>
%e The addition table, M_9:
%e + | 0 1 3 7 12 20 30 44 65
%e -----+-----------------------------
%e 0 | 0
%e 1 | 1 2
%e 3 | 3 4 6
%e 7 | 7 8 10 14
%e 12 | 12 13 15 19 24
%e 20 | 20 21 23 27 32 40
%e 30 | 30 31 33 37 42 50 60
%e 44 | 44 45 47 51 56 64 74 88
%e 65 | 65 66 68 72 77 85 95 109 130
%o (C++) See Links section.
%Y Cf. A337655, A337656, A337658.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Oct 01 2020