|
|
|
|
|
|
|
|
|
#19 by Peter Luschny at Mon Jun 17 07:15:08 EDT 2024
|
|
|
|
|
|
|
|
#18 by Joerg Arndt at Mon Jun 17 07:12:45 EDT 2024
|
|
|
|
|
|
|
|
#17 by Amiram Eldar at Mon Jun 17 00:46:17 EDT 2024
|
|
|
|
|
|
|
|
#16 by Amiram Eldar at Mon Jun 17 00:40:15 EDT 2024
|
|
| REFERENCES
|
G. George E. Andrews, K. and Kimmo Eriksson, Integer Partitions, Cambridge Univ. Press, 2004, Cambridge, 2004.
M. BonaMiklós Bóna, A Walk Through Combinatorics, World Scientific Publishing Co., 2002.
|
|
|
|
|
|
|
#15 by Amiram Eldar at Mon Jun 17 00:37:58 EDT 2024
|
|
|
|
|
|
|
|
#14 by Alois P. Heinz at Fri Feb 14 16:26:24 EST 2020
|
|
|
|
|
|
|
|
#13 by Alois P. Heinz at Fri Feb 14 16:26:21 EST 2020
|
|
| COMMENTS
|
We define the Heinz number of a partition p = [p_1, p_2, ..., p_r] as Product(p_j-th prime, j=1...r) (concept used by _Alois P. Heinz _ in A215366 as an "encoding" of a partition). For example, for the partition [1, 1, 2, 4, 10] we get 2*2*3*7*29 = 2436.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#12 by Joerg Arndt at Sat Dec 10 06:24:16 EST 2016
|
|
|
|
|
|
|
|
#11 by Jean-François Alcover at Sat Dec 10 05:16:11 EST 2016
|
|
|
|
|
|
|
|
#10 by Jean-François Alcover at Sat Dec 10 05:16:05 EST 2016
|
|
| MATHEMATICA
|
a[n_] := Sum[If[PrimePi[i[[1]]] // OddQ, i[[2]], 0], {i, FactorInteger[n]} ]; Table[a[n], {n, 1, 120}] (* Jean-François Alcover, Dec 10 2016, after Alois P. Heinz *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
