// output of ./demo/comb/partition-odd-asc-subset-lex-demo.cc: // Description: //% Partitions of n into odd parts, subset-lex order. //% Loopless algorithm. //% Cf. OEIS sequence A000009. //% See Joerg Arndt, Subset-lex: did we miss an order?, (2014) //% http://arxiv.org/abs/1405.6503 arg 1: 19 == n [partitions of n] default=19 0: [ 1] [ 19 ] 1: [ 3] [ 1 1 17 ] 2: [ 5] [ 1 1 1 1 15 ] 3: [ 7] [ 1 1 1 1 1 1 13 ] 4: [ 9] [ 1 1 1 1 1 1 1 1 11 ] 5: [11] [ 1 1 1 1 1 1 1 1 1 1 9 ] 6: [13] [ 1 1 1 1 1 1 1 1 1 1 1 1 7 ] 7: [15] [ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 5 ] 8: [17] [ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 ] 9: [19] [ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ] 10: [15] [ 1 1 1 1 1 1 1 1 1 1 1 1 1 3 3 ] 11: [13] [ 1 1 1 1 1 1 1 1 1 1 1 3 5 ] 12: [13] [ 1 1 1 1 1 1 1 1 1 1 3 3 3 ] 13: [11] [ 1 1 1 1 1 1 1 1 1 3 7 ] 14: [11] [ 1 1 1 1 1 1 1 1 1 5 5 ] 15: [11] [ 1 1 1 1 1 1 1 1 3 3 5 ] 16: [ 9] [ 1 1 1 1 1 1 1 3 9 ] 17: [11] [ 1 1 1 1 1 1 1 3 3 3 3 ] 18: [ 9] [ 1 1 1 1 1 1 1 5 7 ] 19: [ 9] [ 1 1 1 1 1 1 3 3 7 ] 20: [ 9] [ 1 1 1 1 1 1 3 5 5 ] 21: [ 7] [ 1 1 1 1 1 3 11 ] 22: [ 9] [ 1 1 1 1 1 3 3 3 5 ] 23: [ 7] [ 1 1 1 1 1 5 9 ] 24: [ 7] [ 1 1 1 1 1 7 7 ] 25: [ 7] [ 1 1 1 1 3 3 9 ] 26: [ 9] [ 1 1 1 1 3 3 3 3 3 ] 27: [ 7] [ 1 1 1 1 3 5 7 ] 28: [ 7] [ 1 1 1 1 5 5 5 ] 29: [ 5] [ 1 1 1 3 13 ] 30: [ 7] [ 1 1 1 3 3 3 7 ] 31: [ 7] [ 1 1 1 3 3 5 5 ] 32: [ 5] [ 1 1 1 5 11 ] 33: [ 5] [ 1 1 1 7 9 ] 34: [ 5] [ 1 1 3 3 11 ] 35: [ 7] [ 1 1 3 3 3 3 5 ] 36: [ 5] [ 1 1 3 5 9 ] 37: [ 5] [ 1 1 3 7 7 ] 38: [ 5] [ 1 1 5 5 7 ] 39: [ 3] [ 1 3 15 ] 40: [ 5] [ 1 3 3 3 9 ] 41: [ 7] [ 1 3 3 3 3 3 3 ] 42: [ 5] [ 1 3 3 5 7 ] 43: [ 5] [ 1 3 5 5 5 ] 44: [ 3] [ 1 5 13 ] 45: [ 3] [ 1 7 11 ] 46: [ 3] [ 1 9 9 ] 47: [ 3] [ 3 3 13 ] 48: [ 5] [ 3 3 3 3 7 ] 49: [ 5] [ 3 3 3 5 5 ] 50: [ 3] [ 3 5 11 ] 51: [ 3] [ 3 7 9 ] 52: [ 3] [ 5 5 9 ] 53: [ 3] [ 5 7 7 ] ct=54