%I A056230
%S A056230 1,2,3,4,6,9,7,11,17,26,12,19,30,47,73,13,25,44,74,121,194,14,27,52,96,
%T A056230 170,291,485,15,29,56,108,204,374,665,1150,16,31,60,116,224,428,802,
%U A056230 1467,2617,18,34,65,125,241,465,893,1695,3162,5779,20,38,72,137,262
%N A056230 Construct difference array so that (1) first row begins with 1, (2) every 
               row is monotonic increasing, (3) no number appears more than once, 
               (4) smallest number not yet used begins a new row. Sequence gives 
               array read by antidiagonals.
%e A056230 Array begins
%e A056230 1 3 9 26 73 194 ...
%e A056230 .2 6 17 47 121 ...
%e A056230 . 4 11 30 74 ...
%e A056230 .. 7 19 44 ...
%e A056230 ... 12 25 ...
%e A056230 .... 13 ...
%Y A056230 Cf. A057153 (first row), A052474 (main diagonal), A057154 (numbers not 
               used), A056231, A056232, A056233, A056234.
%Y A056230 Sequence in context: A159849 A098168 A035312 this_sequence A119919 A036561 
               A082976
%Y A056230 Adjacent sequences: A056227 A056228 A056229 this_sequence A056231 A056232 
               A056233
%K A056230 nice,nonn,easy,tabl
%O A056230 1,2
%A A056230 Jonas Wallgren (jonwa(AT)ida.liu.se), Jul 30, 2000.