[seqfan] A technical question concerning edge cases.

[Peter Luschny]

One of my programs gives the following output:
[1] [ ] [4] [8] [36, 16] [72, 32] [900, 216, 144, 64]

How can I list this sequence?
1, *, 4, 8, 36, 16, 72, 32, 900, 216, 144, 64, ..
Without the '*' the seq starts like (and is certainly
related to) http://oeis.org/A046056  (the smallest order
for which there are n nonisomorphic finite Abelian groups,
or 0 if no such order exists).

Thus, should I ignore the empty set [ ]? Or should I insert
a placeholder '0'? Or better a '2' because the right side
of the triangle are the 2^n? Or should I put the offset
to 2 to avoid this problem?

OK, you want to know the meaning of these numbers. I looked
at the integer partitions of n which do not have '1' as a
part and encoded them by the usual product prime(i)^p(i)...
The triangle of these integer partitions starts
[[ ]]
[ ]
[[2]]
[[3]]
[[2, 2], [4]]
[[3, 2], [5]]
[[2, 2, 2], [3, 3], [4, 2], [6]]

A002865 (the number of partitions of n that do not contain
1 as a part) starts 1, 0, 1, 1, 2, 2, 4, ... for n>=0.

I am confused. What is the best solution?
Peter