The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A181317 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A181317

Triangle in which n-th row lists all partitions of n, in the order of increasing smallest numbers of prime signatures.
(history; published version)

#30 by Alois P. Heinz at Tue Feb 16 08:35:50 EST 2021

STATUS

editing

approved

#29 by Alois P. Heinz at Tue Feb 16 08:30:50 EST 2021

EXAMPLE

[1]

[1];

[2], [1,1];

[3], [2,1], [1,1,1];

[4], [3,1], [2,2], [2,1,1], [1,1,1,1];

[5], [4,1], [3,2], [3,1,1], [2,2,1], [2,1,1,1], [1,1,1,1,1];

[6], [5,1], [4,2], [3,3], [4,1,1], [3,2,1], [3,1,1,1], [2,2,2], ...;

...

STATUS

approved

editing

#28 by Alois P. Heinz at Tue Feb 16 08:30:03 EST 2021

STATUS

proposed

approved

#27 by Jean-François Alcover at Tue Feb 16 08:09:08 EST 2021

STATUS

editing

proposed

#26 by Jean-François Alcover at Tue Feb 16 08:09:03 EST 2021

MATHEMATICA

f[P_] := Times @@ (Prime[Range[Length[P]]]^P);

row[n_] := SortBy[IntegerPartitions[n], f];

Array[row, 7] // Flatten (* Jean-François Alcover, Feb 16 2021 *)

STATUS

approved

editing

#25 by Susanna Cuyler at Sun Dec 15 22:00:10 EST 2019

STATUS

proposed

approved

#24 by Omar E. Pol at Sun Dec 15 08:38:55 EST 2019

STATUS

editing

proposed

Discussion

Sun Dec 15

08:39

Omar E. Pol: a(100)-a(105).

#23 by Omar E. Pol at Thu Dec 12 14:27:54 EST 2019

DATA

1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 4, 3, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 5, 4, 1, 3, 2, 3, 1, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 6, 5, 1, 4, 2, 3, 3, 4, 1, 1, 3, 2, 1, 3, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 6, 1, 5, 2, 4, 3, 5, 1, 1, 4, 2, 1, 3, 3, 1, 4, 1, 1, 1, 3, 2, 2, 3, 2, 1, 1, 2

STATUS

approved

editing

Discussion

Thu Dec 12

14:29

Omar E. Pol: Dear Alois: I added three terms to differentiate this sequence and A330370. Hope that´s OK.

14:30

Omar E. Pol: I meant: six terms.

#22 by Alois P. Heinz at Tue Dec 23 18:03:15 EST 2014

STATUS

editing

approved

#21 by Alois P. Heinz at Tue Dec 23 18:03:11 EST 2014

MAPLE

elif n=0 then ll:= ll, [mul (ithprime (t)^l[t], t=1..nops(l)), l]

map (h-> h[2][], sort ([ll], (x, y)-> x[1]<y[1]))[]

STATUS

approved

editing