cp's OEIS Frontend

A227955 Triangle read by rows, T(n, k) = prime(1)^p(k,1)*...*prime(n)^p(k,n) where p(k,j) is the j-th part of the k-th partition of n. The partitions of n are ordered in reversed lexicographic order read from left-to-right, starting with [1,1,...1] going down to [n].

%I A227955 #31 Mar 14 2015 01:02:20
%S A227955 1,2,6,4,30,12,8,210,60,36,24,16,2310,420,180,120,72,48,32,30030,4620,
%T A227955 1260,900,840,360,216,240,144,96,64,510510,60060,13860,6300,9240,2520,
%U A227955 1800,1080,1680,720,432,480,288,192,128,9699690,1021020,180180,69300,44100
%N A227955 Triangle read by rows, T(n, k) = prime(1)^p(k,1)*...*prime(n)^p(k,n) where p(k,j) is the j-th part of the k-th partition of n. The partitions of n are ordered in reversed lexicographic order read from left-to-right, starting with [1,1,...1] going down to [n].
%C A227955 The sequence can be seen as an encoding of Young's lattice (see the links).
%C A227955 The ordering of Young's lattice is such that for two Young diagrams s, t, we have s <= t if and only if the Young diagram of s fits entirely inside the Young diagram of t (when the two diagrams are arranged so their lower-left corners coincide.) This order translates to our encoding as the divisibility relation. The number corresponding to s divides the number corresponding to t if and only if s <= t.
%C A227955 The partition corresponding to a number can be recovered as the exponents of the primes in the prime factorization of the number.
%H A227955 Peter Luschny, <a href="/A227955/b227955.txt">Rows n = 0..25, flattened</a>
%H A227955 Peter Luschny, <a href="/A227955/a227955.jpg">Young's lattice (diagram)</a>
%H A227955 Peter Luschny, <a href="http://oeis.org/wiki/User:Peter_Luschny/IntegerPartitionTrees">Integer partition trees</a>
%H A227955 Wikipedia, <a href="http://en.wikipedia.org/wiki/Young%27s_lattice">Young's lattice</a>
%e A227955 For instance the partitions of 4 are ordered [1,1,1,1], [2,1,1,0], [2,2,0,0], [3,1,0,0], [4,0,0,0]. Consider the partition P = (3,2,1,1) written as a Young diagram (in French notation):
%e A227955     [ ]
%e A227955     [ ]
%e A227955     [ ][ ]
%e A227955     [ ][ ][ ]
%e A227955 Next replace the boxes at the bottom line by the sequence of primes and write the number of boxes in the same column as exponents; then multiply. 2^4*3^2*5^1 = 720. 720 will appear in line 7 of the triangle (because P is a partition of 7) at position 10 (because the sequence of exponents [4, 2, 1] is the 10th partition in the order of partitions which we assume).
%e A227955 [0]     1,
%e A227955 [1]     2,
%e A227955 [2]     6,    4,
%e A227955 [3]    30,   12,    8,
%e A227955 [4]   210,   60,   36,  24,  16,
%e A227955 [5]  2310,  420,  180, 120,  72,  48,  32,
%e A227955 [6] 30030, 4620, 1260, 900, 840, 360, 216, 240, 144, 96, 64.
%p A227955 with(combinat):
%p A227955 A227955_row := proc(n) local e, w, p;
%p A227955 p := [seq(ithprime(i), i=1..n)];
%p A227955 w := e -> mul(p[i]^e[nops(e)-i+1], i=1..nops(e));
%p A227955 seq(w(e), e = partition(n)) end:
%p A227955 seq(print(A227955_row(i)), i=0..8);
%o A227955 (Sage)
%o A227955 def A227955_row(n):
%o A227955     L = []
%o A227955     P = primes_first_n(n)
%o A227955     for p in Partitions(n):
%o A227955         L.append(mul(P[i]^p[i] for i in range(len(p))))
%o A227955     return L[::-1]
%o A227955 for n in (0..8): A227955_row(n)
%Y A227955 Reversed rows: A036035, row sums: A074140.
%K A227955 nonn,tabf
%O A227955 0,2
%A A227955 _Peter Luschny_, Aug 01 2013