

A066202


Array T(n,k) (n>=1, k>=1) read by antidiagonals: T(n,n) = 1 for all n; fill in array above diagonal by symmetry; for row n, starting at diagonal T(n,n)=1, for k > n, T(n,k) = T(n,k1)(k1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k1)+(k1).


3



1, 2, 2, 4, 1, 4, 7, 3, 3, 7, 3, 6, 1, 6, 3, 8, 10, 4, 4, 10, 8, 14, 5, 8, 1, 8, 5, 14, 21, 11, 13, 5, 5, 13, 11, 21, 13, 4, 7, 10, 1, 10, 7, 4, 13, 22, 12, 14, 16, 6, 6, 16, 14, 12, 22, 12, 21, 6, 9, 12, 1, 12, 9, 6, 21, 12, 23, 31, 15, 17, 19, 7, 7, 19, 17, 15, 31, 23, 11, 20, 5, 8, 11, 14, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)




