OFFSET
1,2
COMMENTS
A strict partition is a partition into distinct parts.
Row n=1 contains the parts of the empty partition, so it is empty.
LINKS
Alois P. Heinz, Rows n = 1..1000, flattened
FORMULA
T(prime(n),1) = n.
EXAMPLE
n = 12 = 2*2*3 = prime(1)*prime(1)*prime(2) encodes strict partition [1,2,4].
Triangle T(n,k) begins:
01 : ;
02 : 1;
03 : 2;
04 : 1, 2;
05 : 3;
06 : 1, 3;
07 : 4;
08 : 1, 2, 3;
09 : 2, 3;
10 : 1, 4;
11 : 5;
12 : 1, 2, 4;
13 : 6;
14 : 1, 5;
15 : 2, 4;
16 : 1, 2, 3, 4;
MAPLE
T:= n-> ((l-> seq(l[j]+j-1, j=1..nops(l)))(sort([seq(
numtheory[pi](i[1])$i[2], i=ifactors(n)[2])]))):
seq(T(n), n=1..100);
MATHEMATICA
T[n_] := Function[l, Table[l[[j]]+j-1, {j, 1, Length[l]}]][Sort[ Flatten[ Table[ Array[ PrimePi[i[[1]]]&, i[[2]]], {i, FactorInteger[n]}]]]];
Table[T[n], {n, 1, 100}] // Flatten // Rest (* Jean-François Alcover, Mar 23 2017, translated from Maple *)
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Alois P. Heinz, Dec 02 2015
STATUS
approved