// output of ./demo/comb/partition-asc-2rep-demo.cc:
// Description:
//% Integer partitions where parts have multiplicity at most 2.
//% Representation as weakly ascending list of parts.
//% Lexicographic order.
//% Cf. OEIS sequence A000726.

arg 1: 14 == n  [integer partitions of n]  default=14
arg 2: 0 == aa  [Whether to render as ASCII art]  default=0
   1:  [ 6]   [ 1 1 2 2 3 5 ]
   2:  [ 6]   [ 1 1 2 2 4 4 ]
   3:  [ 5]   [ 1 1 2 2 8 ]
   4:  [ 6]   [ 1 1 2 3 3 4 ]
   5:  [ 5]   [ 1 1 2 3 7 ]
   6:  [ 5]   [ 1 1 2 4 6 ]
   7:  [ 5]   [ 1 1 2 5 5 ]
   8:  [ 4]   [ 1 1 2 10 ]
   9:  [ 5]   [ 1 1 3 3 6 ]
  10:  [ 5]   [ 1 1 3 4 5 ]
  11:  [ 4]   [ 1 1 3 9 ]
  12:  [ 4]   [ 1 1 4 8 ]
  13:  [ 4]   [ 1 1 5 7 ]
  14:  [ 4]   [ 1 1 6 6 ]
  15:  [ 3]   [ 1 1 12 ]
  16:  [ 5]   [ 1 2 2 3 6 ]
  17:  [ 5]   [ 1 2 2 4 5 ]
  18:  [ 4]   [ 1 2 2 9 ]
  19:  [ 5]   [ 1 2 3 3 5 ]
  20:  [ 5]   [ 1 2 3 4 4 ]
  21:  [ 4]   [ 1 2 3 8 ]
  22:  [ 4]   [ 1 2 4 7 ]
  23:  [ 4]   [ 1 2 5 6 ]
  24:  [ 3]   [ 1 2 11 ]
  25:  [ 4]   [ 1 3 3 7 ]
  26:  [ 4]   [ 1 3 4 6 ]
  27:  [ 4]   [ 1 3 5 5 ]
  28:  [ 3]   [ 1 3 10 ]
  29:  [ 4]   [ 1 4 4 5 ]
  30:  [ 3]   [ 1 4 9 ]
  31:  [ 3]   [ 1 5 8 ]
  32:  [ 3]   [ 1 6 7 ]
  33:  [ 2]   [ 1 13 ]
  34:  [ 5]   [ 2 2 3 3 4 ]
  35:  [ 4]   [ 2 2 3 7 ]
  36:  [ 4]   [ 2 2 4 6 ]
  37:  [ 4]   [ 2 2 5 5 ]
  38:  [ 3]   [ 2 2 10 ]
  39:  [ 4]   [ 2 3 3 6 ]
  40:  [ 4]   [ 2 3 4 5 ]
  41:  [ 3]   [ 2 3 9 ]
  42:  [ 3]   [ 2 4 8 ]
  43:  [ 3]   [ 2 5 7 ]
  44:  [ 3]   [ 2 6 6 ]
  45:  [ 2]   [ 2 12 ]
  46:  [ 4]   [ 3 3 4 4 ]
  47:  [ 3]   [ 3 3 8 ]
  48:  [ 3]   [ 3 4 7 ]
  49:  [ 3]   [ 3 5 6 ]
  50:  [ 2]   [ 3 11 ]
  51:  [ 3]   [ 4 4 6 ]
  52:  [ 3]   [ 4 5 5 ]
  53:  [ 2]   [ 4 10 ]
  54:  [ 2]   [ 5 9 ]
  55:  [ 2]   [ 6 8 ]
  56:  [ 2]   [ 7 7 ]
  57:  [ 1]   [ 14 ]
 ct=57