// output of ./demo/comb/ascent-rgs-subset-lex-demo.cc:
// Description:
//% Ascent sequences (restricted growth strings, RGS) in subset-lex order.
//% An ascent sequence is a sequence [d(1), d(2), ..., d(n)] where d(1)=0, d(k)>=0,
//% and d(k) <= 1 + asc([d(1), d(2), ..., d(k-1)]) and asc(.) counts the number
//% of ascents of its argument.
//% Cf. OEIS sequence A022493.

arg 1: 5 == n  [Length of strings]  default=5
   1:  [ . . . . . ]   0
   2:  [ . 1 . . . ]   1
   3:  [ . 1 1 . . ]   2
   4:  [ . 1 2 . . ]   2
   5:  [ . 1 2 1 . ]   3
   6:  [ . 1 2 2 . ]   3
   7:  [ . 1 2 3 . ]   3
   8:  [ . 1 2 3 1 ]   4
   9:  [ . 1 2 3 2 ]   4
  10:  [ . 1 2 3 3 ]   4
  11:  [ . 1 2 3 4 ]   4
  12:  [ . 1 2 2 1 ]   3
  13:  [ . 1 2 2 2 ]   4
  14:  [ . 1 2 2 3 ]   4
  15:  [ . 1 2 1 1 ]   3
  16:  [ . 1 2 1 2 ]   4
  17:  [ . 1 2 1 3 ]   4
  18:  [ . 1 2 . 1 ]   3
  19:  [ . 1 2 . 2 ]   4
  20:  [ . 1 2 . 3 ]   4
  21:  [ . 1 1 1 . ]   2
  22:  [ . 1 1 2 . ]   3
  23:  [ . 1 1 2 1 ]   4
  24:  [ . 1 1 2 2 ]   4
  25:  [ . 1 1 2 3 ]   4
  26:  [ . 1 1 1 1 ]   3
  27:  [ . 1 1 1 2 ]   4
  28:  [ . 1 1 . 1 ]   3
  29:  [ . 1 1 . 2 ]   4
  30:  [ . 1 . 1 . ]   2
  31:  [ . 1 . 2 . ]   3
  32:  [ . 1 . 2 1 ]   4
  33:  [ . 1 . 2 2 ]   4
  34:  [ . 1 . 2 3 ]   4
  35:  [ . 1 . 1 1 ]   3
  36:  [ . 1 . 1 2 ]   4
  37:  [ . 1 . 1 3 ]   4
  38:  [ . 1 . . 1 ]   3
  39:  [ . 1 . . 2 ]   4
  40:  [ . . 1 . . ]   1
  41:  [ . . 1 1 . ]   3
  42:  [ . . 1 2 . ]   3
  43:  [ . . 1 2 1 ]   4
  44:  [ . . 1 2 2 ]   4
  45:  [ . . 1 2 3 ]   4
  46:  [ . . 1 1 1 ]   3
  47:  [ . . 1 1 2 ]   4
  48:  [ . . 1 . 1 ]   3
  49:  [ . . 1 . 2 ]   4
  50:  [ . . . 1 . ]   2
  51:  [ . . . 1 1 ]   4
  52:  [ . . . 1 2 ]   4
  53:  [ . . . . 1 ]   3
 ct=53