|
%I #8 Dec 05 2016 11:41:10
%S 1,1,1,2,1,1,1,2,1,3,1,1,1,1,2,1,1,3,1,4,2,2,1,1,1,1,1,2,1,1,1,3,1,1,
%T 4,1,5,3,2,2,2,1,1,1,1,1,1,1,2,1,1,1,1,3,1,1,1,4,1,1,5,1,6,4,2,3,2,1,
%U 3,3,2,2,1,1,2,2,2,1,1,1,1,1,1
%N Triangle in which n-th row lists all integer partitions of n, in order of traversing the periphery of the Fenner-Loizou tree in the clockwise sense.
%C If the Fenner-Loizou tree is traversed in the counterclockwise sense (preorder traversal) the integer partitions are in lexicographic order.
%D T. I. Fenner and G. Loizou, Comp. J. 23 (1980), 332-337.
%D D. E. Knuth, TAOCP 4 (2005), fasc. 3, 7.2.1.4, exercise 10.
%H Peter Luschny, Integer Partition Trees, <a href="http://oeis.org/wiki/User:Peter_Luschny/IntegerPartitionTrees">OEIS wiki</a>.
%e First five rows are:
%e [[1]]
%e [[1, 1], [2]]
%e [[1, 1, 1], [2, 1], [3]]
%e [[1, 1, 1, 1], [2, 1, 1], [3, 1], [4], [2, 2]]
%e [[1, 1, 1, 1, 1], [2, 1, 1, 1], [3, 1, 1], [4, 1], [5], [3, 2], [2, 2,1]]
%Y See A036036 for the Hindenburg (graded reflected colexicographic) ordering.
%Y See A036037 for the graded colexicographic ordering.
%Y See A080576 for the Maple (graded reflected lexicographic) ordering.
%Y See A080577 for the Mathematica (graded reverse lexicographic) ordering.
%Y See A193073 for the graded lexicographic ordering.
%Y See A228100 for the Fenner-Loizou (binary tree) ordering.
%K nonn,tabf
%O 1,4
%A _Peter Luschny_, Jan 21 2011
|
